Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

PCP theorem · Vinony

EntityQ1140200· pop 7· linked from 32 articles

PCP theorem

Sign in to save

theorem in complexity theory that every problem in NP has probabilistically checkable proofs

Connections

International Standard Book Number

mathematical proof

digital object identifier

International Standard Serial Number

Shafrira Goldwasser

computational complexity theory

László Lovász

decision problem

boolean satisfiability problem

complexity class

Mathematical Reviews

independent set

randomized algorithm

computational complexity

Categories

Quantum information theory Randomized algorithms Theorems in computational complexity theory

Sources

wikipedia.externallinksexternallink

What links here32 pages

approximation algorithm

probabilistically checkable proof

list of computer scientists

interactive proof system

Shafrira Goldwasser

Post correspondence problem

Nikolas Breuckmann

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

probabilistically checkable proof

Entitydist 0.34

Entitydist 0.46

Entitydist 0.48

semantic security

Entitydist 0.52

interactive proof system

Entitydist 0.53

computer-assisted proof

Entitydist 0.55

Wikipedia:Verifiability

Entitydist 0.59

probabilistic Turing machine

Entitydist 0.60

probabilistic automaton

Entitydist 0.60

A priori probability

Entitydist 0.61

Dempster–Shafer theory

Entitydist 0.62

multinomial theorem

Entitydist 0.62