What does ZPP mean in Unclassified?

This page is about the meanings of the acronym/abbreviation/shorthand ZPP in the Miscellaneous field in general and in the Unclassified terminology in particular.

Zirconium Production Plant

Miscellaneous » Unclassified

Translation

Find a translation for Zirconium Production Plant in other languages:

Select another language:

  • - Select -
  • 简体中文 (Chinese - Simplified)
  • 繁體中文 (Chinese - Traditional)
  • Español (Spanish)
  • Esperanto (Esperanto)
  • 日本語 (Japanese)
  • Português (Portuguese)
  • Deutsch (German)
  • العربية (Arabic)
  • Français (French)
  • Русский (Russian)
  • ಕನ್ನಡ (Kannada)
  • 한국어 (Korean)
  • עברית (Hebrew)
  • Gaeilge (Irish)
  • Українська (Ukrainian)
  • اردو (Urdu)
  • Magyar (Hungarian)
  • मानक हिन्दी (Hindi)
  • Indonesia (Indonesian)
  • Italiano (Italian)
  • தமிழ் (Tamil)
  • Türkçe (Turkish)
  • తెలుగు (Telugu)
  • ภาษาไทย (Thai)
  • Tiếng Việt (Vietnamese)
  • Čeština (Czech)
  • Polski (Polish)
  • Bahasa Indonesia (Indonesian)
  • Românește (Romanian)
  • Nederlands (Dutch)
  • Ελληνικά (Greek)
  • Latinum (Latin)
  • Svenska (Swedish)
  • Dansk (Danish)
  • Suomi (Finnish)
  • فارسی (Persian)
  • ייִדיש (Yiddish)
  • հայերեն (Armenian)
  • Norsk (Norwegian)
  • English (English)

Definition

What does ZPP mean?

ZPP
In complexity theory, ZPP is the complexity class of problems for which a probabilistic Turing machine exists with these properties: It always returns the correct YES or NO answer. The running time is polynomial in expectation for every input. In other words, if the algorithm is allowed to flip a truly-random coin while it is running, it will always return the correct answer and, for a problem of size n, there is some polynomial p such that the average running time will be less than p, even though it might occasionally be much longer. Such an algorithm is called a Las Vegas algorithm. Alternatively, ZPP can be defined as the class of problems for which a probabilistic Turing machine exists with these properties: It always runs in polynomial time. It returns an answer YES, NO or DO NOT KNOW. The answer is always either DO NOT KNOW or the correct answer. It returns DO NOT KNOW with probability at most 1/2. The two definitions are equivalent. The definition of ZPP is based on probabilistic Turing machines, but, for clarity, note that other complexity classes based on them include BPP and RP. The class BQP is based on another machine with randomness: the quantum computer.

see more »

Popularity rank by frequency of use

How popular is ZPP among other acronyms?

ZPP#1#12236#12977

Embed

Citation

Use the citation below to add this abbreviation to your bibliography:

Style:MLAChicagoAPA

"ZPP." Abbreviations.com. STANDS4 LLC, 2021. Web. 7 Mar. 2021. <https://www.abbreviations.com/term/1651822>.

Discuss this ZPP abbreviation with the community:

0 Comments

    Quiz

    The ultimate acronym test

    »
    CABG
    • A. Coronary Angiography Blood Plaque
    • B. Cell Acute Bowel Gastroenteritis
    • C. Coronary Artery Bypass Graft
    • D. Coronary Arteries Blockage

    Free, no signup required:

    Add to Chrome

    Get instant explanation for any acronym or abbreviation that hits you anywhere on the web!

    Free, no signup required:

    Add to Firefox

    Get instant explanation for any acronym or abbreviation that hits you anywhere on the web!