Emergent Mind
A Separation of NP and coNP in Multiparty Communication Complexity
(1004.0817)
Published Apr 6, 2010
in
cs.CC
Abstract
We prove that NP differs from coNP and coNP is not a subset of MA in the number-on-forehead model of multiparty communication complexity for up to k = (1-\epsilon)log(n) players, where \epsilon>0 is any constant. Specifically, we construct a function F with co-nondeterministic complexity O(log(n)) and Merlin-Arthur complexity n{\Omega(1)}. The problem was open for k > 2.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.