Site Navigation
Categories:
Probabilistic complexity classes
Summary Of: BPP
every BPP algorithm operating on inputs of bounded length can be derandomized into a deterministic algorithm using... BPP has subexponential time simulations unless... BPP if E requires exponential circuits...
Encyclodia Page On: BPP
These Are Links To Other Documents
BPP (disambiguation)
|
complexity theory
|
decision problems
|
probabilistic Turing machine
|
polynomial time
|
probability
|
constant
|
drops off exponentially
|
Chernoff bound
|
probabilistic algorithms
|
subset
|
NP
|
PH
|
NP-complete
|
RP
|
PP
|
PH
|
pseudorandom number generators
|
conjectured
|
circuit complexity
|
EXPTIME
|
MA
|
Babai
|
Monte Carlo algorithm
|
randomized algorithm
|
Las Vegas algorithm
|
ZPP
|
P/poly
|
determining
|
prime
|
PRIMES is in P
|
Manindra Agrawal
|
Neeraj Kayal
|
Nitin Saxena
|
co-RP
|
polynomial identity testing
|
low
|
oracle machine
|
Turing machine
|
quantum computer
|
BQP
|
boolean circuit
|
circuit complexity
|
EXPTIME
|
Russell Impagliazzo
|
doi
|
Simon Fraser University
|
Christos Papadimitriou
|
ISBN 0-201-53082-1
|
Michael Sipser
|
ISBN 0-534-94728-X
|
v
|
d
|
complexity classes
|
more
|
P
|
NP
|
co-NP
|
NP-C
|
co-NP-C
|
NP-hard
|
UP
|
#P
|
#P-C
|
L
|
NL
|
NC
|
P-C
|
PSPACE
|
PSPACE-C
|
EXPTIME
|
NEXPTIME
|
EXPSPACE
|
2-EXPTIME
|
PR
|
RE
|
Co-RE
|
RE-C
|
Co-RE-C
|
R
|
BQP
|
RP
|
ZPP
|
PCP
|
IP
|
PH
|
Category
|
Probabilistic complexity classes
|
This article is licensed under the
GNU Free Documentation License
. It uses material from the
Wikipedia article "BPP"
.
