EntityQ841495· pop 8· linked from 107 articlesprobabilistically checkable proofSign in to savetype 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 proofConnectionscomplexity classEntityNEXPTIMEEntityInternational Standard Book NumberEntitycryptographyEntitymathematical proofEntitydigital object identifierEntityUniversity of WashingtonEntityNew York UniversityEntityformal languageEntityCambridge University PressEntityP versus NP problemEntitycomputational complexity theoryEntityQ22908627EntityNP-completeEntityNPEntityalphabetEntitydecision problemEntityPEntityregular languageEntityNP-hardEntityCategoriesMathematical proofsRandomized algorithms