Searching for "Three-query PCPs with perfect completeness over non-Boolean domains." – 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.

Three-Query PCPs with Perfect Completeness over non-Boolean Domains
by Lars Engebretsen, Jonas Holmerin — 2002 — In Proceedings of the 18th IEEE Conference on Computational Complexity
…Three-Query PCPs with Perfect Completeness over non-Boolean Domains Lars Engebretsen and Jonas…
Cited by 2 (1 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB