DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» PP (complexity)
PP (complexity)
Computational Complexity: a Modern Approach
The Complexity Zoo
CS286.2 Lectures 5-6: Introduction to Hamiltonian Complexity, QMA-Completeness of the Local Hamiltonian Problem
Complexity Theory
Probabilistic Proof Systems: a Primer
A Short History of Computational Complexity
6.845 Quantum Complexity Theory, Lecture 16
1 Class PP(Probabilistic Poly-Time) 2 Complete Problems for BPP?
Oh! Boatman, Haste! Pp♯ 4 4 4 4 4
Lecture 24: QMA: Quantum Merlin-Arthur 1 Introduction 2 Merlin
Advanced Complexity Theory Spring 2016
Complexity Theory
Restricted Relativizations of Probabilistic Polynomial Time
The Computational Complexity of Probabilistic Planning
Dichotomy Theorems for Generalized Chromatic Polynomials
5 NP Completeness1
QMA/Qpoly ⊆ PSPACE/Poly : De-Merlinizing Quantum Protocols
Quantum Computation and Complexity
Top View
6.845 Quantum Complexity Theory, Lecture 04
Hamiltonian Complexity and QMA-Completeness
28.1 Probabilistically Checkable Proofs
Quantum Complexity Theory
Lecture 5 : FP Vs #P Question 1 Complexity Class PP
A Simple Proof of Vyalyi's Theorem and Some Generalizations
Classical Simulation of Commuting Quantum Computations Implies
Chapter 34 NP-Completeness
Lecture 13: the Complexity of Counting 1 Proof of Lauteman's
A Superpolynomial Lower Bound on the Size of Uniform Non-Constant
Lecture 23: Introduction to Quantum Complexity Theory 1 REVIEW
Complexity-Theoretic Aspects of Interactive Proof Systems
Quantum Merlin Arthur (QMA) and Strong Error Reduction
Probabilistic Checking of Proofs: a New Characterization of NP
The NP-Completeness of Some Edge-Partitioning Problems
8 Probabilistically Checkable Proofs
Invsat (A.K.A. Pp-Definability) Is Co-NEXPTIME-Complete
Probabilistic Complexity Classes 1