Pages that link to "Item:Q3832042"
From MaRDI portal
The following pages link to The Boolean Hierarchy I: Structural Properties (Q3832042):
Displayed 50 items.
- Efficient algorithms for membership in Boolean hierarchies of regular languages (Q306282) (← links)
- Toward the complexity of the existence of wonderfully stable partitions and strictly core stable coalition structures in enemy-oriented hedonic games (Q314437) (← links)
- The complexity of computing minimal unidirectional covering sets (Q372959) (← links)
- Mind change speed-up for learning languages from positive data (Q388110) (← links)
- The strong exponential hierarchy collapses (Q584250) (← links)
- Observations on complete sets between linear time and polynomial time (Q627129) (← 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)
- New developments in structural complexity theory (Q913509) (← links)
- Kolmogorov complexity and degrees of tally sets (Q916650) (← links)
- On the complexity of test case generation for NP-hard problems (Q917311) (← links)
- The Boolean hierarchy of NP-partitions (Q924719) (← links)
- The complexity of unions of disjoint sets (Q955349) (← links)
- The 1-versus-2 queries problem revisited (Q970102) (← links)
- Exact complexity of exact-four-colorability (Q1014384) (← links)
- The three-color and two-color Tantrix\(^{\text{TM}}\) rotation puzzle problems are NP-complete via parsimonious reductions (Q1041029) (← links)
- Polynomial terse sets (Q1104077) (← links)
- Complexity classes without machines: on complete languages for UP (Q1109566) (← links)
- Bounded query classes and the difference hierarchy (Q1114678) (← links)
- On truth-table reducibility to SAT (Q1173957) (← links)
- A uniform approach to define complexity classes (Q1200807) (← links)
- The random oracle hypothesis is false (Q1333397) (← links)
- Universally serializable computation (Q1384538) (← links)
- A second step towards complexity-theoretic analogs of Rice's Theorem (Q1575716) (← links)
- The closure of monadic NP (Q1577017) (← links)
- Reducing the number of solutions of NP functions (Q1608321) (← links)
- On the complexity of automatic complexity (Q1694011) (← links)
- Commutative queries (Q1854422) (← links)
- Bounded queries, approximations, and the Boolean hierarchy (Q1854449) (← links)
- Reasoning with power defaults (Q1882904) (← links)
- Cognitive hierarchy and voting manipulation in \(k\)-approval voting (Q2019338) (← links)
- From NP-completeness to DP-completeness: a membrane computing perspective (Q2205967) (← links)
- Acceptance in incomplete argumentation frameworks (Q2238645) (← links)
- On qualitative route descriptions. Representation, agent models, and computational complexity (Q2341261) (← links)
- A complexity theory for feasible closure properties (Q2366687) (← links)
- Quantum and classical complexity classes: Separations, collapses, and closure properties (Q2486397) (← links)
- All superlinear inverse schemes are coNP-hard (Q2575753) (← links)
- Resource bounded immunity and simplicity (Q2576870) (← links)
- A note on parallel queries and the symmetric-difference hierarchy. (Q2583533) (← links)
- Cluster computing and the power of edge recognition (Q2643084) (← links)
- Function operators spanning the arithmetical and the polynomial hierarchy (Q3060205) (← links)
- Hybrid Elections Broaden Complexity-Theoretic Resistance to Control (Q3392307) (← links)
- Simultaneous strong separations of probabilistic and unambiguous complexity classes (Q3992020) (← links)
- On the power of deterministic reductions to C=P (Q4032933) (← links)
- Query Order (Q4210168) (← links)
- Characterizing and extending answer set semantics using possibility theory (Q4592973) (← links)
- A Survey on Difference Hierarchies of Regular Languages (Q4637687) (← links)
- Complexity classes between $\Theta _k^P$ and $\Delta _k^P$ (Q4717047) (← links)
- On Existentially First-Order Definable Languages and Their Relation to NP (Q4718893) (← links)
- On computing Boolean connectives of characteristic functions (Q4835862) (← links)