Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

ZPP (complexity)

Known as: ZPP, Zero error probability in polynomial time, Zero-error Probabilistic Polynomial time 
In complexity theory, ZPP (zero-error probabilistic polynomial time) is the complexity class of problems for which a probabilistic Turing machine… Expand
Wikipedia

Related topics

Related topics

19 relations
BPP (complexity)BQPComplete (complexity)Complexity class
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
The Complexity of Optimal Mechanism Design
Myerson's seminal work provides a computationally efficient revenue-optimal auction for selling one item to multiple bidders [18… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2007
2007
The Hardness of Approximating Poset Dimension
Abstract The dimension of a partially ordered set (poset) is the minimum integer k such that the partial order can be expressed… Expand
  • figure 1
Is this relevant?
Highly Cited
2006
Highly Cited
2006
ORANI-G: A Generic Single-Country Computable General Equilibrium Model
The ORANI applied general equilibrium (AGE) model of the Australian econ- omy has been widely used by academics and by economists… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2005
2005
The SAT2002 competition
SAT Competition 2002 held in March–May 2002 in conjunction with SAT 2002 (the Fifth International Symposium on the Theory and… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds
Abstract.We show that derandomizing Polynomial Identity Testing is essentially equivalent to proving arithmetic circuit lower… Expand
Is this relevant?
2003
2003
Approximate coloring of uniform hypergraphs
We consider an algorithmic problem of coloring r-uniform hypergraphs. The problem of finding the exact value of the chromatic… Expand
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Improved inapproximability results for MaxClique, chromatic number and approximate graph coloring
  • S. Khot
  • Proceedings IEEE International Conference on…
  • 2001
    • Corpus ID: 11987483
The author presents improved inapproximability results for three problems: the problem of finding the maximum clique size in a… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Clique Is Hard to Approximate within n1-o(1)
It was previously known that Max Clique cannot be approximated in polynomial time within n1-Ɛ, for any constant Ɛ > 0, unless NP… Expand
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Zero Knowledge and the Chromatic Number
We present a new technique, inspired by zero-knowledge proof systems, for proving lower bounds on approximating the chromatic… Expand
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Oracles and Queries That Are Sufficient for Exact Learning
We show that the class of all circuits is exactly learnable in randomized expected polynomial time using weak subset and weak… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE