<--- Back to Details
First PageDocument Content
Mathematical optimization / Complexity classes / Computational complexity theory / P versus NP problem / Quantum computer / Association for Computing Machinery / Computing / Complexity / NP / Theoretical computer science / Applied mathematics / Computer science
Date: 2008-01-21 09:57:10
Mathematical optimization
Complexity classes
Computational complexity theory
P versus NP problem
Quantum computer
Association for Computing Machinery
Computing
Complexity
NP
Theoretical computer science
Applied mathematics
Computer science

Add to Reading List

Source URL: www.cs.cmu.edu

Download Document from Source Website

File Size: 901,40 KB

Share Document on Facebook

Similar Documents

LATEX Class for the Association for Computing Machinery ∗ Boris Veytsman† , v1.54 Abstract

DocID: 1v9LM - View Document

Association for Computing Machinery Advancing Computing as a Science & Profession Statewide Databases of Registered Voters: Study Of Accuracy, Privacy, Usability, Security, and Reliability Issues commissioned by the U.S.

DocID: 1uwU1 - View Document

Author’s Guide to the ACM SIGPLAN Class (sigplanconf.cls) Association for Computing Machinery SIGPLAN

DocID: 1urYg - View Document

The SIGSPATIAL Special Newsletter of the Association for Computing Machinery Special Interest Group on Spatial Information Editorial Highlights from ACM SIGSPATIAL GIS 2012 IWCTS 2012 Workshop Report

DocID: 1ucNN - View Document

The SIGSPATIAL Special Newsletter of the Association for Computing Machinery Special Interest Group on Spatial Information Volume 6

DocID: 1ua91 - View Document