Zhi-Quan Luo
- 1 ABELSON, H. Towards a theory of local and global computation. Theoret. Comput. ScL 6 (1978), 41-67.Google Scholar
Cross Ref
- 2 ABELSON, H. Lower bounds on information transfer in distnbutcd computations. J. ACM 27, 2 (1980), 384 392. Google ScholarDigital Library
- 3 AHO, A. V., ULLMAN, J. D., AND YANNAKAKiS, M. On notions of information transfer in VLSI circuits. In Proceedings of &e 15th Annual Symposium oJz Theory o/Computing (Boston, Mass., Apr. 25-27). ACM, New York, 1983, pp. 133 139. Google ScholarDigital Library
- 4 ATIYAH, M., AND MACDONALD, I. Introduction to CommutatlL,e Algebra. Addison-Wesley, Reading, Pa., 1969.Google Scholar
- 5 BERTSEKAS, D. P., AND TSITSIKLIS, J. N. Parallel and Distributed Corn?~tation. Numerical Methods. Prentice-Hall, Englewood Cliffs, N.J., 1989. Google ScholarDigital Library
- 6 BLUM, L., SHUB, M., AND SMALL, S. On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Btdl. AMS 21, 1 (1989), 1-47.Google Scholar
- 7 BORODIN, A., ,AND MUNRO, I. The Computational Complexity of Algebraic and Numeric Problems. American Elsevier, New York, 1975.Google Scholar
- 8 CHANDRA, A. K., FURST, M. L., AND LIPTON, R.J. Multi-party protocols. In Proceedmga of the 15th Annual Symposium on TheoO, of Computing (Boston, Mass., Apr. 25-27). ACM, New York, 1983, pp. 94-99. Google ScholarDigital Library
- 9 GORDAN, P., AND NOETHER, M. Ueber die Algebraischen Formen, deren Hesse'sche Determinante Identisch Verschwindet. Math. Ann. lO (1876), 547 568.Google Scholar
- 10 HARTSHORNE, R. Algebrcac Geometry. Springer-Verlag, New York, 1977.Google Scholar
- 11 KLEIMAN, $. L. Tangency and duahty. In Proceedings of the CMS Summer Instltttte ill Algebraic Geometry (Vancouver, B.C., Canada), 1984.Google Scholar
- 12 Luo, Z.Q. Communication complexity of some problems in distributed computation. Ph.D. dissertation. Operations Research Center, Tech. Rep. L}{DS-TH-1909. Laboratory for Information and Decision Systems. MIT, Cambridge, Mass., 1989.Google Scholar
- 13 Luo, Z. Q., AND TSITSIKLIS, J.N. On the comnmnication complexity of solving a polynomial equation. SIAMJ. Comput. 20, 5 (1991), 936-950. Google ScholarDigital Library
- 14 MEHLHORN, K., AND SCHMIDT, E. g. Las Vegas is better than determinism in VLS1 and distributed computing. In Proceedings of the 14th Symposium on Theory of Computing (San Francisco, Calif., May 5-7). ACM, New York, 1982, pp. 330-337. Google ScholarDigital Library
- 15 PANG, K. F., AND EL GAMAL, A. Communication complexity of computing the hamming distance. SIAMJ. Compat. 15, 4 (1986), 932 947. Google ScholarDigital Library
- 16 PAPADIM1TRIOU, C. H., AND SIPSER, M. Communication complexity. In Proceedings of the 14th Symposium oil Theory of Computing (San Francisco, Calif., May 5-7). ACM, New York, 1982, pp. 196-200. Google ScholarDigital Library
- 17 PAPADIMITRIOU, C. H., AND TSITSIKL1S, J. N. On the complexity of designing distributed protocols, hlf. Cont. 53, 3 (1982), pp. 211 218.Google Scholar
- 18 TENNEY, R. g., AND SANDELL, N. g., JR. Detection with distributed sensors. IEEE Trans. Aerospace Electronic Syst. AES-I7, 4 (1981), pp. 501-510.Google ScholarCross Ref
- 19 TSITSIKL1S, J. N., AND LUO, Z. Q. Communication complexity of convex optimization. J. Complex. 3 (1987), 231 243. Google ScholarDigital Library
- 20 ULLMAN, J. D. Computational Aspects of I/LSI. Computer Science Press, Rockville, Md., 1984. Google ScholarDigital Library
- 21 VAN DER WAERDEN, B.L. ModenlAlgebra, Vol. I & 2. Ungar, New York, 1953.Google Scholar
- 22 W~LLSKY, A. S., BELLO, M. G., CASTANON, D. A., LEVY, B. C., AND VERGHESE, G. C. Combining and updating of local estimates and regional maps along sets of one-dimensional tracks. IEEE Trans. Aurora. Cont. AC-27, 4 (1982), 799-812.Google ScholarCross Ref
- 23 YAO, A.C. Some complexity questions related to distributed computing. In Proceedings of the llth Symposium on Theory of Computing (Atlanta, Ga., Apr. 30-May 2). ACM, New York, 1979, pp. 209-213. Google ScholarDigital Library
- 24 ZAK, F. Projection of algebraic varieties. Math. U.S.S.R. Sbormk 44 (1983), 535-554.Google ScholarCross Ref
- 25 ZARISK1, O., AND SAMUEL, P. Commatatk,e Algebra, vol. 1. Van Nostrand, New Jersey, 1965.Google Scholar
Index Terms
- On the communication complexity of distributed algebraic computation
Recommendations
Communication complexity of algebraic computation
SFCS '90: Proceedings of the 31st Annual Symposium on Foundations of Computer ScienceThe authors consider a situation in which two processors P/sub 1/ and P/sub 2/ are to evaluate one or more functions f/sub 1/, . . ., f/sub s/ of two vector variables x and y, under the assumption that processor P/sub 1/ (respectively, P/sub 2/) has ...
Amortized Communication Complexity
In this work we study the direct-sum problem with respect to communication complexity: Consider a relation $f$ defined over $\{0,1\}^{n} \times \{0,1\}^{n}$. Can the communication complexity of simultaneously computing $f$ on $\cal l$ instances $(x_1,...
Fractional Covers and Communication Complexity
It is possible to view communication complexity as the minimum solution of an integer programming problem. This integer programming problem is relaxed to a linear programming problem and from it information regarding the original communication ...
Comments