The following pages link to (Q4249529):
Displaying 6 items.
- Self-improved gaps almost everywhere for the agnostic approximation of monomials (Q884469) (← links)
- On the capacity of Boolean graph formulæ (Q1805371) (← links)
- On domain-partitioning induction criteria: worst-case bounds for the worst-case based (Q1885908) (← links)
- The complexity of properly learning simple concept classes (Q2462500) (← links)
- (Q3838403) (← links)
- Hardness of approximate two-level logic minimization and PAC learning with membership queries (Q5920702) (← links)