<--- Back to Details
First PageDocument Content
Applied mathematics / EXPSPACE / 2-EXPTIME / NP / Automated planning and scheduling / EXPTIME / Non-deterministic Turing machine / DSPACE / Alternating Turing machine / Theoretical computer science / Computational complexity theory / Complexity classes
Date: 2003-05-27 08:56:44
Applied mathematics
EXPSPACE
2-EXPTIME
NP
Automated planning and scheduling
EXPTIME
Non-deterministic Turing machine
DSPACE
Alternating Turing machine
Theoretical computer science
Computational complexity theory
Complexity classes

Add to Reading List

Source URL: www.informatik.uni-freiburg.de

Download Document from Source Website

File Size: 92,53 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