Nondeterministic communication with a limited number of advice bits

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129452, Issue , 1996, Pages 551-560

  Hromkovic, J ^a   Schnitger, G ^b  

^a UNIVERSITY OF KIEL   (Germany)

^b GOETHE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL METHODS; FUNCTIONS; INFORMATION THEORY; MATHEMATICAL MODELS; NETWORK PROTOCOLS; OPTIMIZATION; PROBABILITY; THEOREM PROVING;

COMMUNICATION COMPLEXITY; LOWER BOUNDS; SMALL REDUCTION;

COMPUTATIONAL COMPLEXITY;

ADVICE BITS; COMMUNICATION COMPLEXITY; NONDETERMINISTIC COMMUNICATION;

EID: 0029700732     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237814.238003     Document Type: Conference Paper

References (18)

1. Abelson H.; Lower bound on an information transfer model in distributed computation, Proc. of the 19th FOCS 1978, pp. 151-158.
2. Aho, A. V., Ullman, J. D. and Yannakakis, M.: On notions of information transfer in VLSI circuits, Proc. of the 15th STOC 1983, pp. 133-139.
3. Babai, L., Frankl, P., and Simon, J.: Complexity classes in communication complexity theory, Proc. of the 27th FOCS 1986, pp. 337-347.
4. Babai, L., Nisan, N. and Szegedy, M.: Multiparty protocols and logspace-hard pseudorandom sequences, Proc. of the 21st STOC 1989, pp. 1-11.
5. Canetti, R. and Goldreich, O.: Bounds on tradeoffs between randomness and communication complexity, Proc. of the 31st FOCS 1990, pp. 766-775.
6. Duris, P., Galil, Z. and Schnitger, G.: Lower bounds on communication complexity, Proc. of the 16th STOC 1984, pp. 81-91.
7. Fleischer, M., Jung, H. and Mehlhorn K.: A timerandomness tradeoff for communication complexity, Proc. 4th Int. Workshop on Distr, Alg. 1990.
8. Frankl, P. and Ftiredi, Z.: A short proof for a theorem of Harper about Hamming spheres, Discrete Math. 34, 1981, pp. 311-313.
9. Halstenberg, B. and Reischuk, R.: On different modes of communication, Proc. of the 20th STOC 1988, pp. 162-172.
10. Ja Ja, J., Prasanna Kumur, V. K. and Simon, J.: Information transfer under different sets of protocols, SIAM J. Comput. 13(1984), pp. 840-849.
11. Kalyanasundaram, B. and Schnitger, G.: Communication complexity and lower bounds for sequential machines, in Festschrift zum 60. Geburtstag von Giinter Hotz, Teubner Verlag 1992, pp. 253-268.
12. Lengauer, T.: VLSI Theory, in J. van Leeuwen (ed.) Handbook of Theoretical Computer Science, vol A, Algorithms and Complexity, Elsevier 1990, pp. 835-868.
13. Mehlhorn, K. and Schmidt, E.: Las Vegas is better than determinism in VLSI, Proc. of the Uth STOC 1982, pp. 330-337.
14. Newman, I.: Private versus common random bits in communication complexity. Inform. Process. Lett. 35(1991), 67-71.
15. Nisan, N. and Wigderson, A.: Rounds in communication complexity revisited, Proc. of the 23rd STOC 1991, pp. 419-429.
16. Raz, R. and Wigderson, A.: Monotone circuits for matching require linear depth, Proc. of the 22nd STOC 1990, pp. 287-292.
17. Yannakakis, M.: Expressing combinatorial optimization problems by linear programs, Proc. of the 20th STOC 1988, pp. 223-228.
18. Yao, A. C.: Some complexity questions related to distributive computing, Proc. of the 11th STOC 1979, pp. 209-213.