2 search results - page 1 / 1 » Hardness of approximate two-level logic minimization and PAC... |
STOC
2006
ACM
14 years 6 months ago
2006
ACM
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
COCO
2001
Springer
13 years 10 months ago
2001
Springer
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...