Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Computational Complexity of Solving Equation SystemsUnary Algebras

Computational Complexity of Solving Equation Systems: Unary Algebras [We introduce the definition of unary algebra as well as subclasses of it called k-valued, strongly-k-valued and strongly-k-generated. Then we proceed with the simplification algorithm that transforms each system of equations into a more regular one at the expense of adding some definable constraints. Finally we give computational complexity characterization of SysTermSat over three-element unary algebras that depends on width of a special preorder constructed from given algebra.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Computational Complexity of Solving Equation SystemsUnary Algebras

Download PDF
19 pages

Loading next page...
 
/lp/springer-journals/computational-complexity-of-solving-equation-systems-unary-algebras-H1P3UXnDfK
Publisher
Springer International Publishing
Copyright
© The Author(s) 2015
ISBN
978-3-319-21749-9
Pages
13 –32
DOI
10.1007/978-3-319-21750-5_2
Publisher site
See Chapter on Publisher Site

Abstract

[We introduce the definition of unary algebra as well as subclasses of it called k-valued, strongly-k-valued and strongly-k-generated. Then we proceed with the simplification algorithm that transforms each system of equations into a more regular one at the expense of adding some definable constraints. Finally we give computational complexity characterization of SysTermSat over three-element unary algebras that depends on width of a special preorder constructed from given algebra.]

Published: Jul 25, 2015

There are no references for this article.