#### Filter Results:

#### Publication Year

2006

2013

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

This paper presents a complete classification of the complexity of the SAT and equivalence problems for two-element algebras. Cases of terms and polynomials are considered. We show that for any fixed two-element algebra the considered SAT problems are either in P or NP-complete and the equivalence problems are either in P or coNP-complete. We show that the… (More)

We show that the term satisfiability problem for finite algebras is in NQL. Moreover we present a complete classification of the computational complexity of the term satisfiability problem for two-element algebras. We show that for any fixed two-element algebra the problem is either in QL or NQL-complete. We show that the complexity of the considered… (More)

Solving equations is one of the most important problems in computer science. Apart from the problem of existence of solutions of equations we may consider the problem of a number of solutions of equations. Such a problem is much more difficult than the decision one. This paper presents a complete classification of the complexity of the problem of counting… (More)

- ‹
- 1
- ›