Back to Results
First PageMeta Content
Complexity classes / Probabilistically checkable proof / Interactive proof system / NP / NEXPTIME / P versus NP problem / IP / P / Clique problem / Theoretical computer science / Computational complexity theory / Applied mathematics


Document Date: 2008-03-13 15:36:52

Open Document

File Size: 347,14 KB

Share Result on Facebook

City

IEEE / /

Company

IBM / 3SAT / /

Country

Israel / /

Currency

USD / /

/

Facility

NP SANJEEV ARORA Princeton University / Jersey AND SHMUEL SAFRA Tel-Aviv University / Stanford University / Tel-Aviv University / /

IndustryTerm

polynomial-time algorithms / subexponential-time algorithms / cryptographic applications / approximation algorithm / interactive proof systems / polynomial-time algorithm / good approximation algorithms / approximate solutions / /

Organization

Math Department / National Science Foundation / CS Division / Stanford University / UC Berkeley / SHMUEL SAFRA Tel-Aviv University / Tel-Aviv / Princeton University / Tel-Aviv University / Tel-Aviv / Association for Computing Machinery / /

Person

SANJEEV ARORA / SHMUEL SAFRA / /

Position

Mathematical Logic General / /

ProvinceOrState

New Jersey / New York / /

PublishedMedium

Journal of the ACM / /

SportsLeague

Stanford University / /

Technology

subexponential-time algorithms / approximation algorithm / polynomial-time algorithms / polynomial-time algorithm / Approximation algorithms / random access / good approximation algorithms / /

SocialTag