Hardness of approximate two-level logic minimization and PAC learning with membership queries (Q5920702): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jcss.2008.07.007 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2017271630 / rank | |||
Normal rank | |||
Revision as of 21:28, 19 March 2024
scientific article; zbMATH DE number 5488572
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
