Searching for "The Complexity of Making Unique Choices Approximating 1-in- k SAT." – 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.

The Complexity of Making Unique Choices: Approximating 1-in-kSAT
by Venkatesan Guruswami, Luca Trevisan — in Proceedings of 8th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems
…The Complexity of Making Unique Choices: Approximating 1-in-k SAT Venkatesan Guruswami 1⋆ and Luca…
Cited by 1 (0 self) – Add To MetaCart

Showing 1 through 1.

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