Back to Results
First PageMeta Content
Complexity classes / Probabilistic complexity theory / Structural complexity theory / Models of computation / Pseudorandom generator / Probabilistically checkable proof / NP / P versus NP problem / Bounded-error probabilistic polynomial / Theoretical computer science / Computational complexity theory / Applied mathematics


Joint Review of1 Computational Complexity: A Conceptual Perspective by Oded Goldreich Published by Cambridge University Press, [removed]pages, Hardcover and
Add to Reading List

Document Date: 2010-09-24 20:19:20

Open Document

File Size: 111,88 KB

Share Result on Facebook

Company

3SAT / Cambridge University Press / Cobham / RP coRP / /

/

Event

Bankruptcy / /

Facility

University of Arkansas / /

IndustryTerm

real estate / randomized logspace algorithms / cryptographic applications / cryptographic systems / probabilistic proof systems / decision problems vs. search problems vs. promise problems / period-finding algorithm / famous quantum algorithms / computing / proof systems / search algorithm / search analogs / integer factorization algorithm / zero-knowledge proof systems / /

Organization

Cambridge University / University of Arkansas / /

Person

Reed-Solomon / Reed-Muller / Sanjeev Arora / Min-Max Lemma / Oded Goldreich Published / Daniel Apon Disclaimer / Daniel Apon / Boaz Barak Published / /

Position

player / /

ProgrammingLanguage

Java / FP / C / /

ProvinceOrState

North Carolina / Arkansas / /

Technology

cryptography / RAM / period-finding algorithm / search algorithm / Java / randomized logspace algorithms / three famous quantum algorithms / dom / integer factorization algorithm / /

SocialTag