Pages that link to "Item:Q1908349"
From MaRDI portal
The following pages link to PP is closed under truth-table reductions (Q1908349):
Displaying 21 items.
- The consequences of eliminating NP solutions (Q458458) (← links)
- CNF and DNF succinct graph encodings (Q515682) (← links)
- Some results on selectivity and self-reducibility (Q672402) (← links)
- Counting classes and the fine structure between \(\mathrm{NC}^1\) and \(L\) (Q764326) (← links)
- On sparse hard sets for counting classes (Q1210293) (← links)
- On closure properties of GapP (Q1337146) (← links)
- When do extra majority gates help? Polylog\((N)\) majority gates are equivalent to one (Q1346613) (← links)
- Circuits over PP and PL (Q1567408) (← links)
- Structural control in weighted voting games (Q2098945) (← links)
- A structured view on weighted counting with relations to counting, quantum computation and applications (Q2216125) (← links)
- A complexity theory for feasible closure properties (Q2366687) (← links)
- Immunity and Simplicity for Exact Counting and Other Counting Classes (Q4265536) (← links)
- Generalized theorems on relationships among reducibility notions to certain complexity classes (Q4298368) (← links)
- Relationships among $PL$, $\#L$, and the determinant (Q4889814) (← links)
- Query order in the polynomial hierarchy (Q5055937) (← links)
- (Q5095623) (← links)
- A relationship between difference hierarchies and relativized polynomial hierarchies (Q5289273) (← links)
- Quantum computing, postselection, and probabilistic polynomial-time (Q5428317) (← links)
- Approximate set union via approximate randomization (Q5918258) (← links)
- On pseudorandomness and resource-bounded measure (Q5941070) (← links)
- Complexity limitations on one-turn quantum refereed games (Q6038714) (← links)
