Skip to content

Hardness of approximate two-level logic minimization and PAC learning with membership queries.

Vitaly Feldman

VenueA*STOC
Year2006
ProceedingsSTOC

Browse the full STOC paper archive.