Pages that link to "Item:Q5492848"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2005 (Q5492848):
Displayed 12 items.
- Strong partial clones and the time complexity of SAT problems (Q340559) (← links)
- On the expression complexity of equivalence and isomorphism of primitive positive formulas (Q692919) (← links)
- Universal algebra and hardness results for constraint satisfaction problems (Q1014634) (← links)
- The complexity of satisfiability problems: Refining Schaefer's theorem (Q1015812) (← links)
- On the complexity of \(\mathbb{H}\)-coloring for special oriented trees (Q1686250) (← links)
- The complexity of problems for quantified constraints (Q1959381) (← links)
- Zeons, orthozeons, and graph colorings (Q2361423) (← links)
- Complexity Classifications for Logic-Based Argumentation (Q2946726) (← links)
- Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint (Q3540174) (← links)
- Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? (Q5504698) (← links)
- Recent Results on the Algebraic Approach to the CSP (Q5504700) (← links)
- Partial Polymorphisms and Constraint Satisfaction Problems (Q5504705) (← links)