Counting solutions of equations over two-element algebras
Abstract
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 solutions of equations over any fixed two-element algebra. It is shown that the complexity of such problems depends only on the clone of term operations of the algebra and for any fixed two-element algebra such a problem is either in FP or #Pcomplete.
Full Text:
PDFDOI: http://dx.doi.org/10.17951/ai.2006.5.1.227-236
Date of publication: 2006-01-01 00:00:00
Date of submission: 2016-04-27 10:15:57
Statistics
Total abstract view - 321
Downloads (from 2020-06-17) - PDF - 0
Indicators
Refbacks
- There are currently no refbacks.
Copyright (c) 2015 Annales UMCS Sectio AI Informatica
This work is licensed under a Creative Commons Attribution 4.0 International License.