Pages that link to "Item:Q4348503"
From MaRDI portal
The following pages link to Oracle separation of complexity classes and lower bounds for perceptrons solving separation problems (Q4348503):
Displaying 5 items.
- A lower bound for perceptrons and an oracle separation of the \(PP^{PH}\) hierarchy (Q1271610) (← links)
- Perceptrons, PP, and the polynomial hierarchy (Q1346615) (← links)
- Extremal properties of polynomial threshold functions (Q2475403) (← links)
- Separating the low and high hierarchies by oracles (Q2638773) (← links)
- Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model (Q3169071) (← links)