On the P versus NP intersected with co-NP question in communication complexity

Information Processing Letters

Volumn 96, Issue 6, 2005, Pages 202-206

  Jukna, Stasys ^a,b  

^a GOETHE UNIVERSITY   (Germany)

^b VILNIUS UNIVERSITY   (Lithuania)

Author keywords

Communication complexity; Computational complexity

Indexed keywords

BOOLEAN FUNCTIONS; INFORMATION THEORY; MATHEMATICAL MODELS; NETWORK PROTOCOLS; POLYNOMIALS; PROBABILISTIC LOGICS;

COMMUNICATION COMPLEXITY; PARTITION MODEL; POLY-LOGARITHMIC COMMUNICATION; TWO-PARTY COMMUNICATION PROTOCOLS;

COMPUTATIONAL COMPLEXITY;

EID: 27644573503     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.08.003     Document Type: Article

References (22)

1. A. Aho, J. Ullman, M. Yannakakis, On notions of information transfer in VLSI circuits, in: Proc. 15th Annual ACM Symp. on the Theory of Computing, 1983, pp. 133-139
2. L. Babai, P. Frankl, J. Simon, Complexity classes in communication complexity theory, in: Proc. 27th Annual IEEE Symp. on Foundations of Comput. Sci., 1986, pp. 337-347
3. M. Blum, R. Impagliazzo, Generic oracles and oracle classes, in: Proc. 28th Annual IEEE Symp. on Foundations of Comput. Sci., 1987, pp. 118-126
4. P. Ďuriš, J. Hromkovič, S. Jukna, M. Sauerhoff, and G. Schnitger On multipartition communication complexity Inform. and Comput. 194 1 2004 49 75
5. J. Hartmanis, L.A. Hemachandra, One-way functions, robustness and non-isomorphism of NP-complete classes, Tech. Rep. DCS TR86-796, Cornell University, 1987
6. J. Ja'Ja', V.K. Prasanna Kummar, and J. Simon Information transfer under different sets of protocols SIAM J. Comput. 13 1984 840 849
7. S. Jukna, and G. Schnitger Triangle-freeness is hard to detect Combin. Probab. Comput. 11 2002 549 569
8. S. Jukna, A. Razborov, P. Savický, and I. Wegener On P versus NP ∩ co-NP for decision trees and read-once branching programs Comput. Complexity 8 4 1999 357 370
9. B. Kalyanasundaram, and G. Schnitger The probabilistic communication complexity of set intersection SIAM J. Discrete Math. 5 4 1992 545 557
10. E. Kushilevitz, and N. Nisan Communication Complexity 1997 Cambridge University Press Cambridge
11. T.W. Lam, and W.L. Ruzzo Results on communication complexity classes J. Comput. System Sci. 44 1992 324 342
12. T. Lengauer VLSI theory Handbook of Theoretical Computer Science vol. A 1990 MIT Press Cambridge, MA 835 868
13. R.J. Lipton, R. Sedgewick, Lower bounds for VLSI, in: Proc. 13th Annual ACM Symp. on the Theory of Computing, 1981, pp. 300-307
14. N. Nisan CREW PRAMs and decision trees SIAM J. Comput. 20 6 1991 999 1007
15. Ch.H. Papadimitriou, and M. Sipser Communication complexity, in: Proc. 14th Annual ACM Symp. on the Theory of Computing, 1982, pp. 196-200. Journal version in J. Comput. System Sci. 28 2 1984 260 269
16. A. Razborov On the distributional complexity of disjointness Theoret. Comput. Sci. 106 2 1992 385 390
17. M. Sauerhoff Lower bounds for randomized read-k-times branching programs Proc. 15th Symp. on Theoretical Aspects in Comput. Sci. Lecture Notes in Comput. Sci. vol. 1373 1999 Springer Berlin 105 115
18. M. Sauerhoff Randomness versus nondeterminism for read-once and read-k branching programs Proc. 20th Symp. on Theoretical Aspects in Comput. Sci. Lecture Notes in Comput. Sci. vol. 2607 2003 Springer Berlin 307 318
19. A by a random oracle A? Combinatorica 9 1989 385 392
20. I. Wegener Branching programs and Binary Decision Diagrams: Theory and Applications Discrete Mathematics and Applications 2000 SIAM Philadelphia, PA
21. A.C. Yao, Some complexity questions related to distributed computing, in: Proc. 11th Annual ACM Symp. on the Theory of Computing, 1979, pp. 209-213
22. A.C. Yao, Lower bounds by probabilistic arguments, in: Proc. 24th Annual IEEE Symp. on Foundations of Comput. Sci., 1983, pp. 420-428