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 SystemsIntroduction

Computational Complexity of Solving Equation Systems: Introduction [We introduce the reader to the problems of solving systems of equations over finite algebras and the Constraint Satisfaction Problem by providing definitions and describing the state of the art. We reference the most relevant work in the area and present existing classifications and dichotomies. We also introduce key definitions for the next chapters and give motivation for exploring unary algebras.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Computational Complexity of Solving Equation SystemsIntroduction

Download PDF
12 pages

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

Abstract

[We introduce the reader to the problems of solving systems of equations over finite algebras and the Constraint Satisfaction Problem by providing definitions and describing the state of the art. We reference the most relevant work in the area and present existing classifications and dichotomies. We also introduce key definitions for the next chapters and give motivation for exploring unary algebras.]

Published: Jul 25, 2015

Keywords: Computational Complexity; Polynomial Time; Relational Structure; Constraint Satisfaction Problem; Local Behavior

There are no references for this article.