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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

Long-term aging of ZPP, which is a core ignitor in pyrotechnic mechanical device (PMD) has been investigated using differential…

2014

Cloud computing is a recent trend in computer science. However, privacy concerns and a lack of trust in cloud providers are an…

2012

2011

For fast analyses of multilayer printed circuit boards and packages, the parallel-plate impedance (Zpp) is often used in…

2011

The paper presents analysis and evaluation of different technologies for preparing maize silage: ZSs - maize harvesting with self…

2007

2001

We show that the class Sp2 is a subclass of ZPP . The proof uses universal hashing, approximate counting and witness sampling. As…

1996

1991

This study intended to obtain an useful information on the prevalence of subjective symptoms, and to clarify the…

1982