<--- Back to Details
First PageDocument Content
Complexity classes / P versus NP problem / NP-complete / NP / Oracle machine / PP / P / Many-one reduction / Time complexity / Theoretical computer science / Computational complexity theory / Applied mathematics
Date: 2003-02-17 11:57:27
Complexity classes
P versus NP problem
NP-complete
NP
Oracle machine
PP
P
Many-one reduction
Time complexity
Theoretical computer science
Computational complexity theory
Applied mathematics

Disjoint NP-Pairs Christian Glaßer 1

Add to Reading List

Source URL: www.cse.buffalo.edu

Download Document from Source Website

File Size: 2,71 MB

Share Document on Facebook

Similar Documents

Mathematics / Mathematical analysis / Applied mathematics / Boolean algebra / Experiment / Measure theory / Sigma-algebra / Markov decision process / Game theory / Mathematical optimization

Logical Methods in Computer Science Vol. 10(1:, pp. 1–29 www.lmcs-online.org Submitted Published

DocID: 1xTZi - View Document

Algebra / Mathematics / Abstract algebra / Category theory / Universal algebra / Boolean algebra / Mathematical logic / Adjoint functors / F-algebra / Variety / Monad / Sigma-algebra

Logical Methods in Computer Science Vol. 2 (5:, pp. 1–31 www.lmcs-online.org Submitted Published

DocID: 1xTH1 - View Document

PP_icon-1_Einladung_A4_L3.indd

DocID: 1xTEi - View Document

R. Jagannathan / Dalit / Forbes India / Jagannathan

ADVANCE INFORMATION 100 POEMS ARE NOT ENOUGHNon-Fiction > Poetry Walking BookFairs-PAN ǀ Rs 299 ǀ 104 pp

DocID: 1xTyC - View Document

Experiment / Mathematical optimization / Vilfredo Pareto / Microeconomics / Multi-objective optimization / Multiple-criteria decision analysis / Probability space / Event / Markov decision process / Pareto efficiency / Mathematical analysis / Economics

Logical Methods in Computer Science Vol. 4 (4:, pp. 1–21 www.lmcs-online.org Submitted Published

DocID: 1xTht - View Document