Hardness of Approximate Two-level Logic Minimization and PAC Learning with Membership Queries

Vitaly Feldman. Hardness of Approximate Two-level Logic Minimization and PAC Learning with Membership Queries. Electronic Colloquium on Computational Complexity (ECCC), (127), 2005. [doi]

Abstract

Abstract is missing.