Date: 2008-03-13 15:36:52

Complexity classes

Probabilistically checkable proof

Interactive proof system

NP

NEXPTIME

P versus NP problem

IP

P

Clique problem

Theoretical computer science

Computational complexity theory

Applied mathematics

Document is deleted from original location.
Use the Download Button below to download from the Web Archive.

File Size: 347,14 KB