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 SystemsPartial Characterizations

Computational Complexity of Solving Equation Systems: Partial Characterizations [We present several partial characterization theorems of computational complexity of solving equations over subclasses of unary algebras. We classify strongly-2-generated and strongly-3-valued unary algebras. We also classify 2-valued four-element unary algebras. Finally we present a diagram of subclasses of four-element algebras that have computational complexity dichotomies and describe subclasses that need further work.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Computational Complexity of Solving Equation SystemsPartial Characterizations

Download PDF
19 pages

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

Abstract

[We present several partial characterization theorems of computational complexity of solving equations over subclasses of unary algebras. We classify strongly-2-generated and strongly-3-valued unary algebras. We also classify 2-valued four-element unary algebras. Finally we present a diagram of subclasses of four-element algebras that have computational complexity dichotomies and describe subclasses that need further work.]

Published: Jul 25, 2015

Keywords: Four-element Algebra; ALGEBRA UNIV; Computational Complexity Characterization; Duality Conjecture; Term Operation

There are no references for this article.