Pages that link to "Item:Q5920702"
From MaRDI portal
The following pages link to Hardness of approximate two-level logic minimization and PAC learning with membership queries (Q5920702):
Displaying 6 items.
- The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory (Q619899) (← links)
- Learning random monotone DNF (Q628302) (← links)
- PCPs and the hardness of generating synthetic data (Q2210447) (← links)
- Mining circuit lower bound proofs for meta-algorithms (Q2351392) (← links)
- (Q5121893) (← links)
- Implementation of Boolean functions with a bounded number of zeros by disjunctive normal forms (Q5413210) (← links)
