Part of the Discrete Mathematics and Theoretical Computer Science book series (DISCMATH)
The class NP is often called the class of problems verifiable in polynomial time. Indeed, a language L is in the class NP iff there exists a binary relation R which satisfies:
• R is decidable in polynomial time;
• there exists k such that if R(x, y), then |y| <O(|x| k );
• L = x: there exists y such that R(x, y).
KeywordsPrime Number Universal Quantifier Boolean Formula Interactive Protocol Interactive Proof
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
© Springer-Verlag London 2004