45- https://doi.org/10.1016/j.jcss.2008.07.007
Hardness of approximate two-level logic minimization and PAC learning with membership queries
- Jul 18, 2008
- Journal of Computer and System Sciences
- Vitaly Feldman
Abstract
Hardness of approximate two-level logic minimization and PAC learning with membership queries
- # DNF Expressions
- # Problems In Logic Design
- # Membership Queries
- # Two-level Logic Minimization
- # Polynomial Approximation Algorithm
- # DNF Formula
- # PAC Learning
- # Proper Learning
- # Logic Design
- # Number Of Variables
