Searching for "Probabilistically Checkable Proofs with Low Amortized Query Complexity." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Probabilistically Checkable Proofs with Low Amortized Query Complexity
by Madhu Sudan, Luca Trevisan — 1998 — In Proceedings of the 39th IEEE Symposium on Foundations of Computer Science
…Probabilistically Checkable Proofs with Low Amortized Query Complexity Madhu Sudan Luca…
Cited by 10 (4 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB