A Separation of NP and coNP in Multiparty Communication Complexity - Computer Science > Computational ComplexityReportar como inadecuado




A Separation of NP and coNP in Multiparty Communication Complexity - Computer Science > Computational Complexity - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: We prove that NP differs from coNP and coNP is not a subset of MA in thenumber-on-forehead model of multiparty communication complexity for up to k =1-\epsilonlogn players, where \epsilon>0 is any constant. Specifically, weconstruct a function F with co-nondeterministic complexity Ologn andMerlin-Arthur complexity n^{\Omega1}. The problem was open for k > 2.



Autor: Dmitry Gavinsky, Alexander A. Sherstov

Fuente: https://arxiv.org/



DESCARGAR PDF




Documentos relacionados