Back to Results
First PageMeta Content
Complexity classes / Quantum complexity theory / Mathematical optimization / Models of computation / NP / Bounded-error probabilistic polynomial / P versus NP problem / PP / Communication complexity / Theoretical computer science / Computational complexity theory / Applied mathematics


On the P versus NP intersected with co-NP question in communication complexity Stasys Jukna Abstract
Add to Reading List

Document Date: 2007-08-30 03:42:23

Open Document

File Size: 224,26 KB

Share Result on Facebook

City

L. A. / Vilnius / Frankfurt / /

Company

Cambridge University Press / J. Comp / /

Country

Germany / Lithuania / /

/

Facility

Cornell University / Institute of Mathematics / /

IndustryTerm

nondeterministic best partition protocols / error protocol / arbitrary probabilistic bounded error protocol / arbitrary deterministic protocol / distributed computing / communication protocols / computing / partition protocols / /

Organization

Universität Frankfurt / Cambridge University / Institute of Mathematics and Informatics / Institut für Informatik Robert-Mayer-Str. / Cornell University / /

Person

Georg Schnitger / Rabin / Prasanna Kummar / V / Hemachandra / Martin Sauerho / Hartmut Klauck / /

/

Position

Prime Minister / partition model of communication / player / /

ProvinceOrState

Pennsylvania / /

PublishedMedium

the Theory of Computing / Theoretical Computer Science / /

Technology

VLSI chips / one-round protocols / partition protocols / arbitrary probabilistic bounded error protocol / probabilistic one-sided error protocol / communication protocols / two-party communication protocols / arbitrary deterministic protocol / /

SocialTag