<--- Back to Details
First PageDocument Content
Mathematical optimization / Computational complexity theory / Conjectures / P versus NP problem / Structural complexity theory / NP / Approximation algorithm / Theoretical computer science / Applied mathematics / Complexity classes
Date: 2004-07-02 12:52:43
Mathematical optimization
Computational complexity theory
Conjectures
P versus NP problem
Structural complexity theory
NP
Approximation algorithm
Theoretical computer science
Applied mathematics
Complexity classes

ÎÃ Efficient computational proofs

Add to Reading List

Source URL: www.nada.kth.se

Download Document from Source Website

File Size: 104,04 KB

Share Document on Facebook

Similar Documents

Computational complexity theory / Theory of computation / Mathematics / Complexity classes / Computational problems / Theoretical computer science / Structural complexity theory / Tutte polynomial / NP / Quantum computing / Time complexity / Reduction

The Complexity of Counting and Randomised Approximation Magnus Bordewich New College University of Oxford

DocID: 1r1Rx - View Document

Computational complexity theory / Theory of computation / Complexity classes / Structural complexity theory / Conjectures / Probability distributions / NP / Polynomial hierarchy / IP / P versus NP problem / PP / P

ON THE RANDOM-SELF-REDUCIBILITY OF COMPLETE SETS JOAN FEIGENBAUMy AND LANCE FORTNOWz

DocID: 1qYTn - View Document

Statistics / Academia / Applied mathematics / Measurement / Monte Carlo method / Numerical analysis / Probabilistic complexity theory / Uncertainty / Structural analysis

Microsoft Word - MS-wccm12

DocID: 1qPof - View Document

Computational complexity theory / Cognition / Neuropsychology / Structural complexity theory / Mathematics / Reduction / Problem solving / Algorithm / Heuristic / How to Solve It / Computational thinking

Microsoft Word - fp16-armoni.doc

DocID: 1qoBn - View Document

Mathematics / Theoretical computer science / Theory of computation / Structural complexity theory / Computability theory / Halting problem / Mathematical proof / Undecidable problem / Negation / Reductio ad absurdum / Reduction / Square root of 2

Issues in Multimedia Authoring Lecture 10: Limitations of Computers Keith Douglas Summary

DocID: 1qeXR - View Document