Pages that link to "Item:Q2366687"
From MaRDI portal
The following pages link to A complexity theory for feasible closure properties (Q2366687):
Displaying 29 items.
- The consequences of eliminating NP solutions (Q458458) (← links)
- The shrinking property for NP and coNP (Q627189) (← links)
- Lower bounds and the hardness of counting properties (Q703531) (← links)
- Languages polylog-time reducible to dot-depth 1/2 (Q859980) (← links)
- On the autoreducibility of functions (Q970103) (← links)
- Simple characterizations of \(P(\# P)\) and complete problems (Q1333395) (← links)
- On closure properties of GapP (Q1337146) (← links)
- Recursion theoretic characterizations of complexity classes of counting functions (Q1365942) (← links)
- A second step towards complexity-theoretic analogs of Rice's Theorem (Q1575716) (← links)
- A note on unambiguous function classes (Q1607022) (← links)
- Reducing the number of solutions of NP functions (Q1608321) (← links)
- The complexity of Bayesian networks specified by propositional and relational languages (Q1711881) (← links)
- Tally NP sets and easy census functions. (Q1854340) (← links)
- The robustness of LWPP and WPP, with an application to graph reconstruction (Q2027204) (← links)
- Further oracles separating conjectures about incompleteness in the finite domain (Q2210516) (← links)
- A complexity theory for feasible closure properties (Q2366687) (← links)
- Quantum and classical complexity classes: Separations, collapses, and closure properties (Q2486397) (← links)
- LWPP and WPP are not uniformly gap-definable (Q2495405) (← links)
- Error-bounded probabilistic computations between MA and AM (Q2507698) (← links)
- Subtractive reductions and complete problems for counting complexity classes (Q2566034) (← links)
- A common algebraic description for probabilistic and quantum computations (Q2575744) (← links)
- Cluster computing and the power of edge recognition (Q2643084) (← links)
- Bounded queries to arbitrary sets (Q4717045) (← links)
- Relationships among $PL$, $\#L$, and the determinant (Q4889814) (← links)
- (Q5005153) (← links)
- The operators min and max on the polynomial hierarchy (Q5047162) (← links)
- P-Optimal Proof Systems for Each NP-Set but no Complete Disjoint NP-Pairs Relative to an Oracle (Q5092409) (← links)
- (Q5095623) (← links)
- Parameterised counting in logspace (Q6093373) (← links)
