<--- Back to Details
First PageDocument Content
Complexity classes / Analysis of algorithms / Probabilistic complexity theory / Bounded-error probabilistic polynomial / Structural complexity theory / Randomized algorithm / RP / ZPP / PP / Theoretical computer science / Computational complexity theory / Applied mathematics
Date: 2003-02-28 10:16:37
Complexity classes
Analysis of algorithms
Probabilistic complexity theory
Bounded-error probabilistic polynomial
Structural complexity theory
Randomized algorithm
RP
ZPP
PP
Theoretical computer science
Computational complexity theory
Applied mathematics

Add to Reading List

Source URL: people.csail.mit.edu

Download Document from Source Website

File Size: 129,51 KB

Share Document on Facebook

Similar Documents

Notes on Computational Complexity Theory CPSC: Spring 2017 James Aspnes:25

DocID: 1uCk4 - View Document

On the notion of bit complexity Claus Diem August 21, 2010 Abstract In many works in the fields of computational complexity, algorithmic number theory and mathematical cryptology as well as in related areas, claims on th

DocID: 1uruF - View Document

Madhu Sudan Gordon McKay Professor, John A. Paulson School of Engineering and Applied Sciences, Harvard University Areas of Special Interests Theory of Computing, Algorithms, Computational Complexity, Reliable Communicat

DocID: 1ulr8 - View Document

Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs Marek Karpi´ nski1, , Andrzej Ruci´ nski2, , and Edyta Szyma´ nska2,  

DocID: 1tW23 - View Document

Computational complexity theory / Logic / Complexity classes / Mathematical logic / PSPACE / FO / Second-order logic / P versus NP problem / Constraint satisfaction problem / NP / P / Constraint satisfaction

Logic, Computation and Constraint Satisfaction Barnaby D. Martin University of Leicester

DocID: 1ruap - View Document