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 SystemsConclusions and Open Problems

Computational Complexity of Solving Equation Systems: Conclusions and Open Problems [We present conclusions and open problems raising from studying solving equations over unary algebras. We suggest areas that are most promising for expanding our knowledge.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Computational Complexity of Solving Equation SystemsConclusions and Open Problems

Download PDF
2 pages

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

Abstract

[We present conclusions and open problems raising from studying solving equations over unary algebras. We suggest areas that are most promising for expanding our knowledge.]

Published: Jul 25, 2015

Keywords: ALGEBRA UNIV; Three-element Unary Algebras; Transparent Characterization; Constraint Satisfaction Problem; Main Open Problem

There are no references for this article.