The power of randomness for communication complexity
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
On different modes of communication
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Monotone circuits for connectivity require super-logarithmic depth
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Monotone circuits for matching require linear depth
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Search problems in the decision tree model (preliminary version)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
The entropic limitations on VLSI computations(Extended Abstract)
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
On notions of information transfer in VLSI circuits
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
One-Way Functions, Robustness, and the Non-Isomorphism of NP-Complete Sets
One-Way Functions, Robustness, and the Non-Isomorphism of NP-Complete Sets
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Lower bounds for cutting planes proofs with small coefficients
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On quantum and probabilistic communication: Las Vegas and one-way protocols
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Two applications of information complexity
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
Our main result is the demonstration of a Boolean function f with nondeterministic and co-nondeterministic complexities O(log n) and &egr;-error randomized complexity &OHgr;(log2 n), for 0 ≤ &egr;