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… (More)
Wikipedia

Related topics

Related topics

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
A ZPP Lifting Theorem
The complexity class ZPP (corresponding to zero-error randomized algorithms with access to one NP oracle query) is known to have… (More)
  • figure 1
  • figure 2
Is this relevant?
2012
2012
An Improved Multiple Scattering Method for Via Structures With Axially Isotropic Modes in an Irregular Plate Pair
An improved multiple scattering method is developed for an irregular plate pair where via pad/antipad radius is electrically… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2012
2012
Extension of the Contour Integral Method to Anisotropic Modes on Circular Ports
In the analysis of power/ground planes in multilayer substrates, circular ports are often used for modeling of via transitions… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
2011
2011
Maximum subset intersection
Article history: Received 9 June 2009 Received in revised form 19 August 2010 Accepted 4 December 2010 Available online 7… (More)
Is this relevant?
2010
2010
Efficient mid-frequency plane inductance computation
In power distribution networks (PDN), the modelling of the mid-frequency inductance for Zpp type plane pairs is very important… (More)
  • figure 1
  • table I
  • table II
  • figure 3
  • figure 4
Is this relevant?
2010
2010
Inapproximability Results for Wavelength Assignment in WDM Optical Networks
  • Keqin Li
  • Informatica, Lith. Acad. Sci.
  • 2010
We address the issue of inapproximability of the wavelength assignment problem in wavelength division multiplexing (WDM) optical… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
Amplifying ZPP^SAT[1] and the Two Queries Problem
This paper shows a complete upward collapse in the Polynomial Hierarchy (PH) if for ZPP, two queries to a SAT oracle is… (More)
  • figure 1
Is this relevant?
2006
2006
Z-Palatoplasty (ZPP): A Technique for Patients Without Tonsils
 
Is this relevant?
2005
2005
The Hardness of Approximating Hereditary Properties
We consider the following class of problems: Given a graph G, find a maximum vertex induced subgraph of G satisfying a nontrivial… (More)
Is this relevant?
2000
2000
New Frontier for Soft Computing Zero-Point Probability for Linear Source Separation
Blind” signal processing techniques have attracted a great deal of interest from the signal processing community in recent years… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?