Pages that link to "Item:Q5891926"
From MaRDI portal
The following pages link to Hardness of approximate two-level logic minimization and PAC learning with membership queries (Q5891926):
Displaying 5 items.
- Finding a minimal 1-DNF consistent with a positive sample is LOGSNP-complete (Q294591) (← links)
- Approximability of minimum AND-circuits (Q1024782) (← links)
- (Q4636977) (← links)
- Hardness of approximate two-level logic minimization and PAC learning with membership queries (Q5920702) (← links)
- Constant depth formula and partial function versions of MCSP are hard (Q6654556) (← links)