Pages that link to "Item:Q584250"

The following pages link to The strong exponential hierarchy collapses (Q584250):

Displaying 34 items.

• Toward the complexity of the existence of wonderfully stable partitions and strictly core stable coalition structures in enemy-oriented hedonic games (Q314437) (← links)
• The strong exponential hierarchy collapses (Q584250) (← links)
• The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory (Q619899) (← links)
• Probabilistic polynomial time is closed under parity reductions (Q751270) (← links)
• Kolmogorov characterizations of complexity classes (Q804291) (← links)
• The complexity of Kemeny elections (Q817813) (← links)
• Guarantees for the success frequency of an algorithm for finding Dodgson-election winners (Q835761) (← links)
• \(P^{NP[O(\log n)]}\) and sparse turing-complete sets for NP (Q908700) (← links)
• Structural properties of oracle classes (Q990941) (← links)
• On truth-table reducibility to SAT (Q1173957) (← links)
• Bounded queries to SAT and the Boolean hierarchy (Q1178690) (← links)
• Polynomial-time compression (Q1198955) (← links)
• Succinctness as a source of complexity in logical formalisms (Q1302307) (← links)
• Census techniques collapse space classes (Q1332770) (← links)
• Separating classes in the exponential-time hierarchy from classes in PH (Q1365687) (← links)
• On parallel hierarchies and \(R_k^i\) (Q1377627) (← links)
• Tally NP sets and easy census functions. (Q1854340) (← links)
• Bounded queries, approximations, and the Boolean hierarchy (Q1854449) (← links)
• Optimal series-parallel trade-offs for reducing a function to its own graph (Q1854508) (← links)
• On the power of unambiguity in log-space (Q1926109) (← links)
• Knowledge-based programs as succinct policies for partially observable domains (Q2046009) (← links)
• Preference-based inconsistency-tolerant query answering under existential rules (Q2093372) (← links)
• Inconsistency-tolerant query answering for existential rules (Q2124462) (← links)
• Controlling weighted voting games by deleting or adding players with or without changing the quota (Q2169970) (← links)
• Complexity of stability (Q2237893) (← links)
• Rational closure for all description logics (Q2321316) (← links)
• Combining answer set programming with description logics for the semantic web (Q2389666) (← links)
• FLP answer set semantics without circular justifications for general logic programs (Q2453743) (← links)
• Equivalence between model-checking flat counter systems and Presburger arithmetic (Q2636509) (← links)
• Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP (Q3374757) (← links)
• The Complexity Landscape of Outcome Determination in Judgment Aggregation (Q5139591) (← links)
• Weak cardinality theorems (Q5718691) (← links)
• Complexity of Stability. (Q6065416) (← links)
• Stability, vertex stability, and unfrozenness for special graph classes (Q6151148) (← links)