×
Log in
Upload File
Most Popular
Study
Business
Design
Technology
Travel
Explore all categories
The top documents tagged [class of problems solvable]
Scott Aaronson (MIT) Based on joint work with John Watrous (U. Waterloo) BQP PSPACE Quantum Computing With Closed Timelike Curves
222 views
David Luebke 1 6/13/2014 CS 332: Algorithms NP Completeness
230 views
lecture 27
1.263 views
(Omer Reingold, 2005) Speaker: Roii Werner TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A AA A A A A AA A
215 views
On the Hardness of Graph Isomorphism Jacobo Tor á n SIAM J. Comput. Vol 33, p1093-1108, 2004. Presenter: Qingwu Yang April, 2006
215 views
Exploring the Limits of the Efficiently Computable Research Directions I Like In Complexity and Physics Scott Aaronson (MIT) Papers and slides at
216 views
Exploring the Limits of the Efficiently Computable Research Directions in Computational Complexity and Physics That I Find Exciting Scott Aaronson (MIT)
218 views
Tonga Institute of Higher Education Design and Analysis of Algorithms
31 views
MIT and James Orlin1 NP-completeness 204.302 in 2005
231 views
3- 1 Chapter 3 The Theory of NP-Completeness. 3- 2 What are the fundamental capabilities and limitations of computers? What makes some problems computationally
224 views
NP-completeness
19 views
NP-complete Problems and Physical Reality
53 views
< Prev
Next >