<--- Back to Details
First PageDocument Content
Complexity classes / NP-hard / NP-complete / P versus NP problem / NP / Polynomial hierarchy / Polynomial / P / Vertex cover / Theoretical computer science / Computational complexity theory / Applied mathematics
Date: 2013-01-24 06:29:17
Complexity classes
NP-hard
NP-complete
P versus NP problem
NP
Polynomial hierarchy
Polynomial
P
Vertex cover
Theoretical computer science
Computational complexity theory
Applied mathematics

covering-revision-without-comments.dvi

Add to Reading List

Source URL: dss.in.tum.de

Download Document from Source Website

File Size: 283,46 KB

Share Document on Facebook

Similar Documents

Computational complexity theory / Cryptography / Complexity classes / Theory of computation / NP / IP / Advice / PP / P / Soundness / Commitment scheme / Certificate

Monotone Batch NP-Delegation with Applications to Access Control Zvika Brakerski∗ Yael Tauman Kalai†

DocID: 1xUdf - View Document

Quantum mechanics / Physics / Theoretical physics / Chemistry / Mathematical formulation of quantum mechanics / Quantum superposition / Unitary transformation / Quantum computing / Hamiltonian / Quantum algorithm / Degenerate energy levels / Schrdinger equation

Lecture 25, Thurs April 20: Hamiltonians Now we’ll move on to our second-to-last unit… Hamiltonians and the Adiabatic Algorithm We’ve seen how it’s an open question whether quantum computers can solve ​NP​-co

DocID: 1xTKi - View Document

PDF Document

DocID: 1xSVG - View Document

PDF Document

DocID: 1xSM6 - View Document

PDF Document

DocID: 1xSJs - View Document