Pages that link to "Item:Q1271610"
From MaRDI portal
The following pages link to A lower bound for perceptrons and an oracle separation of the \(PP^{PH}\) hierarchy (Q1271610):
Displaying 5 items.
- An oracle separating \(\oplus P\) from \(PP^{PH}\) (Q751272) (← links)
- Perceptrons, PP, and the polynomial hierarchy (Q1346615) (← links)
- Learning DNF in time \(2^{\widetilde O(n^{1/3})}\) (Q1887713) (← links)
- A Bound on the Precision Required to Estimate a Boolean Perceptron from Its Average Satisfying Assignment (Q3440259) (← links)
- Oracle separation of complexity classes and lower bounds for perceptrons solving separation problems (Q4348503) (← links)
