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


Document Date: 2006-08-04 16:47:47

Open Document

Share Result on Facebook

City

New York / Los Angeles / /

Company

SIAM Journal / IEEE Computer Society Press / HP / Cobham / /

IndustryTerm

quantum computer algorithm / propositional proof systems / nondeterministic algorithm / feasible algorithm / polynomial-time algorithm / search problem / recognition algorithm / important tool / universal search problem / polynomial-time integer-factoring algorithm / polynomial-time algorithms / feasible and polynomial-time algorithms / circuit computing / linear time algorithm / binary search / feasible recognition algorithm / arbitrary algorithms / randomized polynomial-time algorithm / polynomial-time and exponential-time algorithms / polynomialtime algorithms / /

Organization

NP / /

Person

Rabin / Hugh Woodin / STEPHEN COOK / Avi Wigderson / Alan Turing / /

Position

read/write head / present author / /

ProgrammingLanguage

L / /

ProvinceOrState

New York / /

PublishedMedium

SIAM Journal on Computing / /

Technology

polynomial-time and exponential-time algorithms / polynomial-time algorithms / randomized polynomial-time algorithm / nondeterministic algorithm / random access / polynomialtime algorithms / encryption / cryptography / public key / feasible and polynomial-time algorithms / polynomial-time algorithm / quantum computer algorithm / feasible recognition algorithm / polynomial-time integer-factoring algorithm / linear time algorithm / feasible algorithm / recognition algorithm / /

SocialTag