Back to Results
First PageMeta Content
Complexity classes / Probabilistic complexity theory / Structural complexity theory / Arthur–Merlin protocol / Karp–Lipton theorem / Quantum complexity theory / NP / Interactive proof system / IP / Theoretical computer science / Computational complexity theory / Applied mathematics


Polylogarithmic-round Interactive Proofs for coNP Collapse the Exponential Hierarchy Alan L. Selman ∗
Add to Reading List

Document Date: 2004-02-23 11:23:03

Open Document

File Size: 688,40 KB

Share Result on Facebook

City

Buffalo / /

Company

Interactive Proof Systems / Russell / /

/

Event

FDA Phase / Product Recall / Product Issues / /

Facility

Engineering University / /

IndustryTerm

prefix search / proof systems / above protocol / /

Organization

National Science Foundation / Department of Computer Science / Computer Science and Engineering University / /

Person

Arthur-Merlin Goldwasser / Arthur / Merlin Goldwasser / Sipser Games / /

Product

proof / LFKN92 / Bab85 / L0 / /

ProgrammingLanguage

L / /

ProvinceOrState

New York / /

Technology

4-move Arthur-Merlin protocol / two-move Arthur-Merlin protocol / polylogarithmic-move Arthur-Merlin protocol / above protocol / length move Arthur-Merlin protocol / AM protocol / 2-move Arthur-Merlin protocol / simulation / Arthur-Merlin protocol / Arthur-Merlin protocols / 2-move protocol / two-move AM protocol / /

SocialTag