Non-deterministic communication complexity with few witnesses
暂无分享,去创建一个
[1] Eric Allender,et al. The Complexity of Sparse Sets in P , 1986, SCT.
[2] G. W. Peck,et al. A new proof of a theorem of Graham and Pollak , 1984, Discret. Math..
[3] Leslie G. Valiant,et al. NP is as easy as detecting unique solutions , 1985, STOC '85.
[4] Mihalis Yannakakis,et al. Expressing combinatorial optimization problems by linear programs , 1991, STOC '88.
[5] Peter Frankl,et al. Complexity classes in communication complexity theory , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[6] John Gill,et al. Counting Classes: Thresholds, Parity, Mods, and Fewness , 1990, Theoretical Computer Science.
[7] Ronald L. Graham,et al. On the addressing problem for loop switching , 1971 .
[8] A. A. Razborov. The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear , 1992, Discret. Math..
[9] Christos H. Papadimitriou,et al. Communication complexity , 1982, STOC '82.
[10] Leslie G. Valiant,et al. Graph-Theoretic Arguments in Low-Level Complexity , 1977, MFCS.
[11] Noga Alon,et al. Multicolored forests in bipartite decompositions of graphs , 1991, J. Comb. Theory, Ser. B.
[12] Kurt Mehlhorn,et al. Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract) , 1982, STOC '82.
[13] Andrew Chi-Chih Yao,et al. Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.
[14] Leslie G. Valiant,et al. Relative Complexity of Checking and Evaluating , 1976, Inf. Process. Lett..
[15] R. Graham,et al. On embedding graphs in squashed cubes , 1972 .
[16] Alfred V. Aho,et al. On notions of information transfer in VLSI circuits , 1983, STOC.
[17] John Gill,et al. Counting Classes: Thresholds, Parity, Mods, and Fewness , 1990, Theor. Comput. Sci..
[18] Michael E. Saks,et al. Lattices, mobius functions and communications complexity , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[19] I. Newman. On read-once Boolean functions , 1992 .