Pages that link to "Item:Q1329166"

The following pages link to A taxonomy of complexity classes of functions (Q1329166):

Displaying 42 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)
• On quasilinear-time complexity theory (Q672330) (← links)
• Computing functions with parallel queries to NP (Q673784) (← 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)
• A hierarchy based on output multiplicity (Q1274991) (← links)
• Functions computable with limited access to NP (Q1351162) (← links)
• Inverting onto functions. (Q1426007) (← links)
• Some structural properties of SAT (Q1587336) (← links)
• Default reasoning from conditional knowledge bases: Complexity and tractable cases (Q1589638) (← links)
• Reducing the number of solutions of NP functions (Q1608321) (← links)
• Competing provers yield improved Karp-Lipton collapse results (Q1775885) (← links)
• On the complexity of data disjunctions. (Q1853503) (← 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)
• Reductions between disjoint NP-pairs (Q2387199) (← links)
• Expressive probabilistic description logics (Q2389639) (← links)
• Graph Isomorphism is in SPP (Q2495656) (← links)
• Resource bounded immunity and simplicity (Q2576870) (← links)
• Cluster computing and the power of edge recognition (Q2643084) (← links)
• Function operators spanning the arithmetical and the polynomial hierarchy (Q3060205) (← links)
• Do there exist complete sets for promise classes? (Q3107337) (← links)
• Solutions to twisted word equations and equations in virtually free groups (Q3299596) (← links)
• The Shrinking Property for NP and coNP (Q3507436) (← links)
• UNIFORM CHARACTERIZATIONS OF COMPLEXITY CLASSES OF FUNCTIONS (Q4528761) (← links)
• Federation and Navigation in SPARQL 1.1 (Q4647814) (← links)
• (Q4989411) (← links)
• The isomorphism problem for finite extensions of free groups is in PSPACE (Q5002826) (← links)
• Polynomial-time axioms of choice and polynomial-time cardinality (Q6109071) (← links)
• Foundations of probability-raising causality in Markov decision processes (Q6151547) (← links)