The Communication Complexity of Enumeration, Elimination, and Selection

Journal of Computer and System Sciences

Volumn 63, Issue 2, 2001, Pages 148-185

  Ambainis, Andris ^a   Buhrman, Harry ^b   Gasarch, William ^c   Kalyanasundaram, Bala ^d   Torenvliet, Leen ^e  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b CWI   (Netherlands)

^c University of Maryland ^*  (United States)

^d GEORGETOWN UNIVERSITY   (United States)

^e UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039299842     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.2001.1761     Document Type: Article

References (54)

1. Agrawal M., Arvind V. Polynomial-time truth-table reductions to P-selective sets. Proc. of the 9th Annual Conference on Structure in Complexity Theory. 1994;IEEE Computer Society Press, Los Alamitos. p. 24-30.
2. Amir A., Beigel R., Gasarch W. Technical Report. 2000.
3. Babai L., Frankl P., Simon J. Complexity classes in communication complexity theory (preliminary version). Proc. of the 27th IEEE Sym. on Found. of Comp. Sci. 1986;. p. 337-347.
4. Beigel R. Query-Limited Reducibilities. 1987;Stanford University.
5. Beigel R. A structural theorem that depends quantitatively on the complexity of SAT. Proc. of the 2nd Annual Conference on Structure in Complexity Theory. June 1987;IEEE Computer Society Press, Los Alamitos. p. 28-32.
6. Beigel R. Bounded queries to SAT and the Boolean hierarchy. Theoret. Comput. Sci. 84:1991;199-223.
7. Beigel R., Gasarch W., Gill J., Owings J. Terse, superterse, and verbose sets. Inform. and Comput. 103:1993;68-85.
8. n. J. Symbolic Logic. 2000;1-18.
9. Beigel R., Hirst T. One help bit doesn't help. Proc. of the 30th ACM Sym. on Theory of Computing. 1998.
10. Beigel R., Kummer M., Stephan F. Approximable sets. Inform. and Comput. 120:1995;304-314.
11. Beigel R., Kummer M., Stephan F. Quantifying the amount of verboseness. Inform. and Comput. 118:1995;73-90.
12. Bollobás B. Extremal Graph Theory. 1978;Academic Press, New York.
13. Bondy J., Murty U. Graph Theory with Applications. 1977;American Elsevier, New York.
14. Bshouty N. H. On the extended direct sum conjecture. STOC89. 1989;. p. 177-185.
15. Bshouty N. H. On the direct sum conjecture in the straight line model. J. Complexity. 14:1998.
16. Cai J., Hemachandra L. A. Enumerative counting is hard. Inform. and Comput. 82:1989;34-44.
17. Cai J., Hemachandra L. A. A note on enumerative counting. Inform. Process. Lett. 38:1991;215-219.
18. Clarke S., Owings J., Spriggs J. Trees with full subtrees. Proc. of the 6th Southeastern Conference on Combinatorics, Graph Theory, and Computing. 1975;. p. 169-172.
19. Downey R., Fellows M. Parameterized Complexity. 1999;Springer-Verlag, Berlin/New York.
20. Feder T., Kushilevitz E., Naor M., Nisan N. Amortized communication complexity. SIAM J. Comput. 24:1995;736-750.
21. Feig E., Winograd S. On the direct sum conjecture. Linear Algebra Appl. 63:1984;193-219.
22. Gasarch W., Martin G. Bounded Queries in Recursion Theory. 1999;BirkhäuserProgress in Computer Science and Applied Logic, Boston.
23. Hajnal A., Maass W., Turán G. The communication complexity of graph properties. Proc. of the 20th ACM Sym. on Theory of Computing. 1988;. p. 186-191.
24. Halstenberg B., Reischuk R. Relations between complexity classes. J. Comput. Systems Sci. 41:1990;402-429.
25. L. Hemaspaandra, and, L. Torenvliet, Theory of Semi-Feasible Algorithms, manuscript in preparation.
26. Jockusch C. Semirecursive sets and positive reducibility. Trans. Amer. Math. Soc. 131:1968;420-436.
27. Kalyanasundaram B., Schnitger G. The probabilistic communication complexity of set intersection. SIAM J. Discrete Math. 5:1992;545-557.
28. Karchmer M. Communication Complexity: A New Approach to Circuit Depth. 1989;MIT Press, Cambridge.
29. Karchmer M., Raz R., Wigderson A. Super-logarithmic depth lower bounds via the direct sum in communication complexity. Comput. Complexity. 5:1995.
30. Ko K.-I. On self-reducibility and weak P-selectivity. J. Comput. Systems Sci. 26:1983;209-221.
31. Krentel M. The complexity of optimization problems. J. Comput. Systems Sci. 36:1988;490-509.
32. Kummer M. A proof of Beigel's cardinality conjecture. J. Symbolic Logic. 57:1992;677-681.
33. Kuratowski K. Sur le probleme des courbes gauches en topologie. Fund. Math. 15:1930;271-283.
34. Kushilevitz E., Nisan N. Communication Complexity. 1997;Cambridge University Press.
35. Lakshmipathy N., Winklmann K. "Global" graph problems tend to be intractable. J. Comput. Systems Sci. 32:1986;407-428.
36. Li M., Vitanyi P. An Introduction to Kolmogorov Complexity and Its Applications. 1991;Addison-Wesley, Reading.
37. L. Lovász, Communications complexity: A survey, in, Paths, Flows, and VLSI Layout, Berlin, 1990, (, B. Korte, Ed.), Springer-Verlag, Berlin/New York. [Early version is TR CS-TR-204-89, Princeton University, 1989.].
38. Lovász L., Saks M. Lattices, mobius functions, and communication complexity. J. Comput. Systems Sci. 47:1993;322-349.
39. Mader W. Homomorphieeigenschaften und mittlere Kantendichte von Graphen. Math. Ann. 174:1967;265-268.
40. Nisan N., Rudich S., Saks M. Products and help bits in decision trees. SIAM J. Comput. 28:1998.
41. Ogihara M. Polynomial-time membership comparable sets. SIAM J. Comput. 24:1995.
42. Owings J. C. Jr. A cardinality version of Beigel's Nonspeedup Theorem. J. Symbolic Logic. 54:1989;761-767.
43. Paul W. J. Realizing Boolean functions on disjoint sets of variables. Theoret. Comput. Sci. 2:1976;383-396.
44. Razborov A. On the distributional complexity of disjointness. Theoret. Comput. Sci. 106:1992;385-390.
45. N. Robertson, and, P. D. Seymour, Graph minors XV: Wagner's conjecture, J. Combin. Theory Ser. B.
46. Robertson N., Seymour P. D. Graph minors XIII: the disjoint paths problem. J. Combin. Theory Ser. B. 63:1995.
47. Sauer N. On the density of families of sets. J. Combin. Theory Ser. A. 13:1972;145-147.
48. Selman A. P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP. Math. Systems Theory. 13:1979;55-65.
49. Selman A. Analogues of semirecursive sets and effective reducibilities to the study of NP complexity. Inform. and Control. 52:1982;36-51.
50. Selman A. Reductions on NP and P-selective sets. Theoret. Comput. Sci. 19:1982;287-304.
51. Sivakumar D. On membership comparable sets. J. Comput. Systems Sci. 1999;270-280.
52. Strassen V. Vermeidung von Divisoren. J. Reine Angew. Math. 264:1973;184-202.
53. Vapnik V. N., Chervonenkis A. Y. On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab. Appl. 16:1971;264-280.
54. Yao A. Some complexity questions related to distributive computing. Proc. of the 11th ACM Sym. on Theory of Computing. 1979.