Hardness of approximate two-level logic minimization and PAC learning with membership queries (Q5920702)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5488572
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hardness of approximate two-level logic minimization and PAC learning with membership queries |
scientific article; zbMATH DE number 5488572 |
Statements
Hardness of approximate two-level logic minimization and PAC learning with membership queries (English)
0 references
9 January 2009
0 references
proper learning
0 references
membership query
0 references
NP-hardness of learning
0 references
DNF
0 references
truth table
0 references
representation-based hardness
0 references
0 references
0.9992448687553406
0 references
0.8271220326423645
0 references
0.8001124858856201
0 references
0.8000600934028625
0 references
0.7922529578208923
0 references
