The following pages link to STACS 2004 (Q5309685):
Displaying 14 items.
- Loosely-abelian algebras (Q292836) (← links)
- Partial algebras and complexity of satisfiability and universal theory for distributive lattices, Boolean algebras and Heyting algebras (Q391322) (← links)
- Complexity of the satisfiability problem for multilinear forms over a finite field (Q682219) (← links)
- On the complexity of equational decision problems for finite height complemented and orthocomplemented modular lattices (Q2073367) (← links)
- (Q2762521) (← links)
- Lattice problems in NP ∩ coNP (Q3546284) (← links)
- A Complexity Index for Satisfiability Problems (Q4286227) (← links)
- Complexity Results for Linear XSAT-Problems (Q4930593) (← links)
- Expressive Power, Satisfiability and Equivalence of Circuits over Nilpotent Algebras. (Q5005117) (← links)
- Satisfiability in MultiValued Circuits (Q5080482) (← links)
- Even Faster Algorithms for CSAT Over supernilpotent Algebras. (Q5089225) (← links)
- STACS 2004 (Q5309710) (← links)
- The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems (Q5868883) (← links)
- The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom (Q5870532) (← links)