Back to Results
First PageMeta Content
Complexity classes / Structural complexity theory / Computability theory / Mathematical optimization / Oracle machine / IP / Interactive proof system / NP / Bounded-error probabilistic polynomial / Theoretical computer science / Computational complexity theory / Applied mathematics


Finding Pessiland Hoeteck Wee ? Computer Science Division University of California, Berkeley [removed]
Add to Reading List

Document Date: 2008-09-15 00:54:53


Open Document

File Size: 110,48 KB

Share Result on Facebook

Country

China / United States / /

/

Facility

Tsinghua University / Computer Science Division University of California / /

IndustryTerm

dot product / polynomial-time algorithm / nonuniform polynomial-time algorithm / probabilistic polynomialtime algorithm / non-trivial argument systems / public-coin argument systems / cryptographic applications / argument systems / oracle nonuniform polynomialtime algorithms / nontrivial argument systems / interactive proof systems / low-communication proof systems / hard-on-average search problem / zero-knowledge proof systems / nonuniform oracle polynomial-time algorithm / /

NaturalFeature

Shannon / /

Organization

University of California / Berkeley / Tsinghua University / Beijing / /

Position

straight-forward / /

ProvinceOrState

California / /

Technology

2-round protocol / cryptography / nonuniform oracle polynomial-time algorithm / probabilistic polynomialtime algorithm / 4-round protocol / nonuniform polynomial-time algorithm / private-key encryption / oracle nonuniform polynomialtime algorithms / polynomial-time algorithm / interactive protocol / /

SocialTag