The following pages link to Complexity of Boolean algebras (Q1137036):
Displayed 20 items.
- On the complexity of Boolean unification (Q293360) (← links)
- What is nominalistic mereology? (Q742476) (← links)
- Turing machines with linear alternation, theories of bounded concatenation and the decision problem of first order theories (Q793017) (← links)
- Simple sentences that are hard to decide (Q810009) (← links)
- Deciding Boolean algebra with Presburger arithmetic (Q861705) (← links)
- A uniform method for proving lower bounds on the computational complexity of logical theories (Q917543) (← links)
- Definability with bounded number of bound variables (Q922523) (← links)
- Alternating tree automata (Q1077932) (← links)
- Existentially closed semilattices (Q1083457) (← links)
- The complexity of linear problems in fields (Q1103602) (← links)
- Dominoes and the complexity of subclasses of logical theories (Q1115859) (← links)
- Tree-size bounded alternation (Q1145502) (← links)
- Dynamic algebras: Examples, constructions, applications (Q1189900) (← links)
- Complexity of logical theories involving coprimality (Q1202924) (← links)
- Negative Boolean constraints (Q1350538) (← links)
- A canonical form of vector machines (Q1383713) (← links)
- A characterization of pseudofinite MV-algebras (Q2153659) (← links)
- Classifying the computational complexity of problems (Q3781088) (← links)
- The Evaluation and the Computational Complexity of Datalog Queries of Boolean Constraint Databases (Q3839873) (← links)
- On decidable varieties of Heyting algebras (Q4032876) (← links)