Searching for "Hardness of approximate two-level logic minimization and PAC learning with membership queries." – 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.

Hardness of Approximate Two-level Logic Minimization and PAC Learning with Membership Queries
by Vitaly Feldman — 2006 — in Proceedings of the 38th Annual ACM Symposium on the Theory of Computing
…Hardness of Approximate Two-level Logic Minimization and PAC Learning with Membership Queries…
Cited by 4 (0 self) – Add To MetaCart

Showing 1 through 1.

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