pcp theoremの例文

例文

もっと例文:   1  2  3


1. Any NP-complete problem by the PCP theorem.
2. In 2005 Irit Dinur discovered a different proof of the PCP theorem, using expander graphs.
3. The PCP theorem is the culmination of a long line of work on interactive proofs and probabilistically checkable proofs.
4. Furthermore, the PCP theorem asserts that the number of proof accesses can be brought all the way down to a constant.
5. Expander graphs have found extensive applications in computer science, in designing algorithms, L ( ) and the PCP theorem ( ).