Pages that link to "Item:Q685716"
From MaRDI portal
The following pages link to Three \(\sum^ P_ 2\)-complete problems in computational learning theory (Q685716):
Displaying 5 items.
- Finding a minimal 1-DNF consistent with a positive sample is LOGSNP-complete (Q294591) (← links)
- On learning unions of pattern languages and tree patterns in the mistake bound model. (Q1853515) (← links)
- Revisiting Shinohara's algorithm for computing descriptive patterns (Q2636407) (← links)
- In Memoriam: Ker-I Ko (1950–2018) (Q3297820) (← links)
- Graph Ramsey theory and the polynomial hierarchy (Q5943091) (← links)