Searching for "Reducing P to a Sparse Set using a Constant Number of Queries Collapses P to L." – 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.

Reducing P to a Sparse Set using a Constant Number of Queries Collapses P to L
by Dieter van Melkebeek — 1996 — In Proceedings of the 11th Conference on Computational Complexity
…Reducing P to a Sparse Set using a Constant Number of Queries Collapses P to L Dieter van Melkebeek…
Cited by 5 (1 self) – Add To MetaCart

Showing 1 through 1.

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