期刊名称：Electronic Colloquium on Computational Complexity
印刷版ISSN：1433-8092
出版年度：2010
卷号：2010
出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
摘要：We prove that NP= coNP and coNP\nsubseteqMA in the number-on-forehead model of multiparty communication complexity for up to k=(1−)logn players, where 0 is any constant. Specifically, we construct a function F:(\zoon)k\zoo with co-nondeterministic
complexity O(logn) and Merlin-Arthur
complexity n(1).
The problem was open for k3.
