<--- Back to Details
First PageDocument Content
Computational complexity theory / Theory of computation / Mathematics / Complexity classes / Analysis of algorithms / Graph coloring / Theoretical computer science / Algorithm / NP / Time complexity / Greedy algorithm / P
Date: 2001-02-16 13:50:35
Computational complexity theory
Theory of computation
Mathematics
Complexity classes
Analysis of algorithms
Graph coloring
Theoretical computer science
Algorithm
NP
Time complexity
Greedy algorithm
P

fea-mcgeoch.qxp:58 AM

Add to Reading List

Source URL: www.ams.org

Download Document from Source Website

File Size: 106,18 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