Pages that link to "Item:Q1346615"
From MaRDI portal
The following pages link to Perceptrons, PP, and the polynomial hierarchy (Q1346615):
Displayed 10 items.
- Perceptrons of large weight (Q734289) (← links)
- On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P (Q845727) (← links)
- A lower bound for perceptrons and an oracle separation of the \(PP^{PH}\) hierarchy (Q1271610) (← links)
- Relating polynomial time to constant depth (Q1274992) (← links)
- Extremal properties of polynomial threshold functions (Q2475403) (← links)
- LWPP and WPP are not uniformly gap-definable (Q2495405) (← links)
- Error-bounded probabilistic computations between MA and AM (Q2507698) (← links)
- A note on the circuit complexity of PP (Q2576885) (← links)
- Immunity and Simplicity for Exact Counting and Other Counting Classes (Q4265536) (← links)
- Quantum computing, postselection, and probabilistic polynomial-time (Q5428317) (← links)