Abstract
Our main result is the demonstration of a Boolean function f with nondeterministic and co-nondeterministic complexities O (log ra) and e-error randomized complexity Ω(log2n), for 0 ≤ ∈ < 1/2. This is the first separation of this kind for a decision problem.
Cite
CITATION STYLE
APA
Bearne, P., & Lawry, J. (1992). Randomized versus nondeterministic communication complexity. In Proceedings of the Annual ACM Symposium on Theory of Computing (Vol. Part F129722, pp. 188–199). Association for Computing Machinery. https://doi.org/10.1145/129712.129732
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free