Pages that link to "Item:Q751270"
From MaRDI portal
The following pages link to Probabilistic polynomial time is closed under parity reductions (Q751270):
Displaying 9 items.
- Manipulating the quota in weighted voting games (Q420828) (← links)
- Kolmogorov characterizations of complexity classes (Q804291) (← links)
- On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P (Q845727) (← links)
- On sparse hard sets for counting classes (Q1210293) (← links)
- Graph isomorphism is low for PP (Q1210331) (← links)
- A lower bound for perceptrons and an oracle separation of the \(PP^{PH}\) hierarchy (Q1271610) (← links)
- Perceptrons, PP, and the polynomial hierarchy (Q1346615) (← links)
- Circuits over PP and PL (Q1567408) (← links)
- A complexity theory for feasible closure properties (Q2366687) (← links)
