Pages that link to "Item:Q5750401"
From MaRDI portal
The following pages link to On the power of parity polynomial time (Q5750401):
Displaying 33 items.
- Modulo classes and logarithmic advice (Q672652) (← links)
- Helping by unambiguous computation and probabilistic computation (Q675865) (← links)
- Probabilistic polynomials, AC\(^ 0\) functions and the polynomial-time hierarchy (Q685431) (← links)
- Lower bounds and the hardness of counting properties (Q703531) (← links)
- Probabilistic polynomial time is closed under parity reductions (Q751270) (← links)
- Kolmogorov characterizations of complexity classes (Q804291) (← links)
- Unambiguous computations and locally definable acceptance types (Q1127545) (← links)
- On sets polynomially enumerable by iteration (Q1176233) (← links)
- On sparse hard sets for counting classes (Q1210293) (← links)
- Gap-definable counting classes (Q1318473) (← links)
- A taxonomy of complexity classes of functions (Q1329166) (← links)
- Representing Boolean functions as polynomials modulo composite numbers (Q1346617) (← links)
- On helping by parity-like languages (Q1349740) (← links)
- Universally serializable computation (Q1384538) (← links)
- Optimal proof systems imply complete sets for promise classes (Q1398371) (← links)
- A second step towards complexity-theoretic analogs of Rice's Theorem (Q1575716) (← links)
- Tally NP sets and easy census functions. (Q1854340) (← links)
- On the power of unambiguity in log-space (Q1926109) (← links)
- Isolation, matching, and counting uniform and nonuniform upper bounds (Q1961370) (← links)
- Counting edge-injective homomorphisms and matchings on restricted graph classes (Q2321927) (← links)
- A complexity theory for feasible closure properties (Q2366687) (← links)
- NL-printable sets and nondeterministic Kolmogorov complexity (Q2369009) (← links)
- Quantum and classical complexity classes: Separations, collapses, and closure properties (Q2486397) (← links)
- THE THOMPSON–HIGMAN MONOIDS M<sub>k,i</sub>: THE ${\mathcal J}$-ORDER, THE ${\mathcal D}$-RELATION, AND THEIR COMPLEXITY (Q2996837) (← links)
- Simultaneous strong separations of probabilistic and unambiguous complexity classes (Q3992020) (← links)
- Separating $\oplus L$ from $L, NL,$ co-$NL$, and $AL = P$ for oblivious Turing machines of linear access (Q4032302) (← links)
- Generalized theorems on relationships among reducibility notions to certain complexity classes (Q4298368) (← links)
- Restrictive Acceptance Suffices for Equivalence Problems (Q4504964) (← links)
- NL-printable sets and Nondeterministic Kolmogorov Complexity (Q4924524) (← links)
- Reductions to sets of low information content (Q5204315) (← links)
- SELF-SPECIFYING MACHINES (Q5249003) (← links)
- On the power of parity polynomial time (Q5750401) (← links)
- Counting classes: Thresholds, parity, mods, and fewness (Q5905584) (← links)
