DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Complete (complexity)
Complete (complexity)
Complexity Theory Lecture 9 Co-NP Co-NP-Complete
NP-Completeness: Reductions Tue, Nov 21, 2017
Computational Complexity: a Modern Approach
NP-Completeness Part I
CS286.2 Lectures 5-6: Introduction to Hamiltonian Complexity, QMA-Completeness of the Local Hamiltonian Problem
NP-Completeness Part II
The Polynomial Hierarchy and Alternations
Glossary of Complexity Classes
A Short History of Computational Complexity
NP-Complete Problems and Physical Reality
1 Complexity Theory
Limits to Parallel Computation: P-Completeness Theory
Computational Complexity
Complexity Theory
Lecture 24: QMA: Quantum Merlin-Arthur 1 Introduction 2 Merlin
5. Polynomial Hierarchy.Pdf
CSE 200 - Computability and Complexity NP and NP-Complete Problems
The Complexity of Equivalent Classes Frank Vega
Top View
CS 473: Fundamental Algorithms, Spring 2011
Electronic Structure in a Fixed Basis Is QMA-Complete
A Gentle Introduction to Computational Complexity Theory, and a Little Bit More
Complexity Classes
Polynomial Hierarchy
The Graph Isomorphism Problem on Geometric Graphs Ryuhei Uehara
6.845 Quantum Complexity Theory, Lecture 04
Hamiltonian Complexity and QMA-Completeness
On NP-Intermediate, Isomorphism Problems, and Polynomial Hierarchy
Quantum Complexity Theory
Local Hamiltonians + QMA Completeness Lecture 19 1
NP-Completeness Part One
QMA-Complete Problems
Computing Complete Graph Isomorphisms and Hamiltonian
NP Completeness • Tractability • Polynomial Time Stephen Cook Leonid Levin Richard Karp • Computation Vs
Introduction to Computational Complexity∗ — Mathematical Programming Glossary Supplement —
Completeness in the Polynomial-Time Hierarchy a Compendium∗
Computational Hardness and Explicit Constructions of Error Correcting Codes