Pages that link to "Item:Q4835862"
From MaRDI portal
The following pages link to On computing Boolean connectives of characteristic functions (Q4835862):
Displaying 18 items.
- Toward the complexity of the existence of wonderfully stable partitions and strictly core stable coalition structures in enemy-oriented hedonic games (Q314437) (← links)
- Lower bounds for kernelizations and other preprocessing procedures (Q538466) (← links)
- Characteristics of multiple viewpoints in abstract argumentation (Q896434) (← links)
- The 1-versus-2 queries problem revisited (Q970102) (← links)
- The computational complexity of ideal semantics (Q1045987) (← links)
- Completeness results for graph isomorphism. (Q1401960) (← links)
- Commutative queries (Q1854422) (← links)
- Bounded queries, approximations, and the Boolean hierarchy (Q1854449) (← links)
- Parameterized random complexity (Q1946497) (← links)
- Two queries (Q1961371) (← links)
- Complexity of stability (Q2237893) (← links)
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete (Q2367539) (← links)
- Lower Bounds for Kernelizations and Other Preprocessing Procedures (Q3576044) (← links)
- Relativized logspace and generalized quantifiers over finite ordered structures (Q4358054) (← links)
- A relationship between difference hierarchies and relativized polynomial hierarchies (Q5289273) (← links)
- The 1-Versus-2 Queries Problem Revisited (Q5387752) (← links)
- Complexity of Stability. (Q6065416) (← links)
- Intersection suffices for Boolean hierarchy equivalence (Q6085737) (← links)
