<--- Back to Details
First PageDocument Content
Complexity classes / TFNP / FNP / NP / PPA / FP / Complete / PLS / P versus NP problem / Theoretical computer science / Computational complexity theory / Applied mathematics
Date: 2004-06-22 14:05:33
Complexity classes
TFNP
FNP
NP
PPA
FP
Complete
PLS
P versus NP problem
Theoretical computer science
Computational complexity theory
Applied mathematics

Note On total functions, existence

Add to Reading List

Source URL: theory.stanford.edu

Download Document from Source Website

File Size: 128,14 KB

Share Document on Facebook

Similar Documents

Character encoding / Combinatorics / String / Computing / Mathematics

Dependency Assessment: Binary Prepared by FP Complete For The Cardano Foundation July 2018

DocID: 1xUPa - View Document

Software engineering / Computing / Programming language theory / Software testing / Extreme programming / Functional languages / Cross-platform software / Procedural programming languages / Code coverage / Haskell / Regression testing / SAT

Dependency Assessment: cborg Prepared by FP Complete For The Cardano Foundation August 2018

DocID: 1xTMC - View Document

PDF Document

DocID: 1xJJf - View Document

PDF Document

DocID: 1xAfi - View Document

PDF Document

DocID: 1vF2n - View Document