🌐EnglishEnglishFrançaisPortuguêsTiếng ViệtРусский한국어日本語EntityQ841495· pop 8· linked from 107 articlesprobabilistically checkable proofAlso known as PCPtype of proof that can be checked by a randomized algorithm using a bounded amount of randomness and reading a bounded number of bits of the proofAvailable in 8 languagesFrançais日本語PortuguêsCatalanSerbianTiếng Việt한국어via Wikidata sitelinks · CC0Connectionscomplexity classEntityNEXPTIMEEntityCategoriesMathematical proofsRandomized algorithms