Back to Results
First PageMeta Content
Complexity classes / NP / P versus NP problem / P / Bounded-error probabilistic polynomial / Time complexity / Oracle machine / Reduction / NP-hard / Theoretical computer science / Computational complexity theory / Applied mathematics


Document Date: 2009-04-13 10:34:31

Open Document

File Size: 99,82 KB

Share Result on Facebook

City

Berlin / Zaragoza / /

Company

Cobham / /

Country

Sudan / /

Currency

USD / /

/

Facility

Clay Institute / /

IndustryTerm

propositional proof systems / quantum computing complexity classes / cryptographic protocols / efficient solution / efficient algorithm / term algorithm / verification algorithm / possible solution / probabilistic algorithms / polynomial time algorithm / verification algorithms / feasible algorithm / brute force search / regular polynomial-time algorithm / Typical tools / possible solutions / exhaustive search / Approximation algorithms / /

MusicGroup

Turing Machine / the Random / /

Organization

Clay Institute / Sistemas Universidad de Zaragoza Mar´ıa de Luna / /

Person

Lance Fortnow / Elvira Mayordomo Departamento de Inform / /

Position

≤pm / researcher / reductions ≤pm / /

ProvinceOrState

Pennsylvania / /

PublishedMedium

Journal of the ACM / /

Technology

regular polynomial-time algorithm / cryptography / efficient algorithm / corresponding verification algorithm / polynomial time algorithm / verification algorithms / verification algorithm / term algorithm / Approximation algorithms / Random Access / feasible algorithm / /

SocialTag