Pages that link to "Item:Q1329166"
From MaRDI portal
The following pages link to A taxonomy of complexity classes of functions (Q1329166):
Displaying 21 items.
- On the query complexity of selecting minimal sets for monotone predicates (Q253999) (← links)
- Is Valiant-Vazirani's isolation probability improvable? (Q354652) (← links)
- The consequences of eliminating NP solutions (Q458458) (← links)
- Average-case intractability vs. worst-case intractability (Q598182) (← links)
- The shrinking property for NP and coNP (Q627189) (← links)
- Detecting and repairing anomalous evolutions in noisy environments. Logic programming formalization and complexity results (Q645074) (← links)
- On the complexity of core, kernel, and bargaining set (Q650525) (← links)
- Complexity classes of equivalence problems revisited (Q716333) (← links)
- Complexity results for explanations in the structural-model approach (Q814579) (← links)
- Probabilistic logic under coherence: complexity and algorithms (Q819942) (← links)
- Nondeterministic functions and the existence of optimal proof systems (Q837177) (← links)
- Pseudorandom generators against advised context-free languages (Q899305) (← links)
- AM\(_{\text{exp}}\nsubseteq (\text{NP} \cap \text{coNP})\)/poly (Q1029043) (← links)
- Theory of one-tape linear-time Turing machines (Q1041220) (← links)
- Reducing the number of solutions of NP functions (Q1608321) (← links)
- Competing provers yield improved Karp-Lipton collapse results (Q1775885) (← links)
- Optimal series-parallel trade-offs for reducing a function to its own graph (Q1854508) (← links)
- New lowness results for ZPP\(^{\text{NP}}\) and other complexity classes. (Q1872705) (← links)
- Černý's conjecture and the road colouring problem (Q2074216) (← links)
- Graph Isomorphism is in SPP (Q2495656) (← links)
- Do there exist complete sets for promise classes? (Q3107337) (← links)
