The following pages link to (Q4743737):
Displaying 50 items.
- A dichotomy for real weighted Holant problems (Q260401) (← links)
- The complexity of computing minimal unidirectional covering sets (Q372959) (← links)
- The consequences of eliminating NP solutions (Q458458) (← links)
- The strong exponential hierarchy collapses (Q584250) (← links)
- On the acceptance power of regular languages (Q672323) (← links)
- On quasilinear-time complexity theory (Q672330) (← links)
- Modulo classes and logarithmic advice (Q672652) (← links)
- Probabilistic polynomials, AC\(^ 0\) functions and the polynomial-time hierarchy (Q685431) (← links)
- Lower bounds and the hardness of counting properties (Q703531) (← links)
- Kolmogorov characterizations of complexity classes (Q804291) (← links)
- The complexity of Kemeny elections (Q817813) (← links)
- Meta-kernelization with structural parameters (Q896025) (← links)
- \(P^{NP[O(\log n)]}\) and sparse turing-complete sets for NP (Q908700) (← links)
- Polynomial size \(\Omega\)-branching programs and their computational power (Q918199) (← links)
- The complexity of combinatorial problems with succinct input representation (Q1090455) (← links)
- Some observations on the connection between counting and recursion (Q1098837) (← links)
- On sets polynomially enumerable by iteration (Q1176233) (← links)
- Turing machines with few accepting computations and low sets for PP (Q1190987) (← links)
- Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P (Q1193633) (← links)
- On sparse hard sets for counting classes (Q1210293) (← links)
- Threshold circuits of small majority-depth (Q1273878) (← links)
- Gap-definable counting classes (Q1318473) (← links)
- Universally serializable computation (Q1384538) (← links)
- A second step towards complexity-theoretic analogs of Rice's Theorem (Q1575716) (← links)
- Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy (Q1784961) (← links)
- Enumerative counting is hard (Q1822963) (← links)
- Tally NP sets and easy census functions. (Q1854340) (← links)
- Alternating and empty alternating auxiliary stack automata. (Q1874397) (← links)
- Structural control in weighted voting games (Q2098945) (← links)
- On the probabilistic closure of the loose unambiguous hierarchy (Q2346573) (← links)
- A complexity theory for feasible closure properties (Q2366687) (← links)
- A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison (Q2404077) (← links)
- Quantum and classical complexity classes: Separations, collapses, and closure properties (Q2486397) (← links)
- A common algebraic description for probabilistic and quantum computations (Q2575744) (← links)
- A note on parallel queries and the symmetric-difference hierarchy. (Q2583533) (← links)
- The complexity of computational problems about Nash equilibria in symmetric win-lose games (Q2659767) (← links)
- Barnette's conjecture through the lens of the \(Mod_k P\) complexity classes (Q2695474) (← links)
- Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP (Q3374757) (← links)
- Counting Homomorphisms to Square-Free Graphs, Modulo 2 (Q3448822) (← links)
- A note on separating the relativized polynomial time hierarchy by immune sets (Q3479518) (← links)
- On Toda’s Theorem in Structural Communication Complexity (Q3599108) (← links)
- Separating $\oplus L$ from $L, NL,$ co-$NL$, and $AL = P$ for oblivious Turing machines of linear access (Q4032302) (← links)
- (Q5005151) (← links)
- Counting Homomorphisms to $K_4$-Minor-Free Graphs, Modulo 2 (Q5013574) (← links)
- The operators min and max on the polynomial hierarchy (Q5047162) (← links)
- The complexity class θp2: Recent results and applications in AI and modal logic (Q5055917) (← links)
- On the power of parity polynomial time (Q5096157) (← links)
- The Complexity Landscape of Outcome Determination in Judgment Aggregation (Q5139591) (← links)
- Stathis Zachos at 70! (Q5283390) (← links)
- The Complexity of Symmetric Boolean Parity Holant Problems (Q5892610) (← links)
