Back to Results
First PageMeta Content
Complexity classes / NP / P versus NP problem / Interactive proof system / Oracle machine / P / Bounded-error probabilistic polynomial / NEXPTIME / EXPTIME / Theoretical computer science / Computational complexity theory / Applied mathematics


Document Date: 2010-05-13 09:39:02

Open Document

File Size: 225,37 KB

Share Result on Facebook

City

Las Vegas / Independence Way Princeton / Boston / /

Company

Oracle / Cobham / /

Country

United States / Soviet Union / Sudan / /

Currency

USD / /

/

Event

FDA Phase / /

Facility

Computational Complexity Lance Fortnow∗ NEC Research Institute / Moscow State University / Steve Homer† Computer Science Department Boston University / Clay Mathematics Institute / /

IndustryTerm

propositional proof systems / polynomial-time approximation algorithm / probabilistic algorithm / possible solution / deterministic polynomial-time algorithm / probabilistic algorithms / interactive proof systems / approximate solution / brute force search / polynomial time solution / computational device / deterministic algorithm / computing / proof systems / polynomialtime algorithm / Zero-knowledge proof systems / approximation algorithms / /

Organization

Moscow State University / National Science Foundation / Harvard / Clay Mathematics Institute / Computational Complexity Lance Fortnow∗ NEC Research Institute / Boston University / /

Person

Rabin / Richard Karp / Leonid Levin / Mansour / Stephen Cook / /

/

Position

traveling salesman / tape head / theoretical model for computation / salesman / /

Product

Babai / BM88 / /

ProvinceOrState

New Jersey / New Foundland and Labrador / Massachusetts / /

Technology

polynomial-time approximation algorithm / cryptography / 8 This algorithm / usually using approximation algorithms / deterministic algorithm / Solovay-Strassen algorithm / approximation algorithms / polynomialtime algorithm / deterministic polynomial-time algorithm / /

URL

http /

SocialTag