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 SystemsReducing CSP to SysTermSat over Unary Algebras

Computational Complexity of Solving Equation Systems: Reducing CSP to SysTermSat over Unary Algebras [We present the computational complexity equivalence of Constraint Satisfaction Problem and solving systems of equations over unary algebras. We give detailed description of the polynomial transformation used both ways. We also prove that solving system of equations over arbitrary finite algebra is polynomially equivalent to solving system of equations over specially constructed unary algebra. Finally we show that if P is not equal to NP then the class of unary algebras for which solving systems of equations is solvable in a polynomial time is not closed under homomorphic images.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Computational Complexity of Solving Equation SystemsReducing CSP to SysTermSat over Unary Algebras

Download PDF
9 pages

Loading next page...
 
/lp/springer-journals/computational-complexity-of-solving-equation-systems-reducing-csp-to-vFCRnEiNOC
Publisher
Springer International Publishing
Copyright
© The Author(s) 2015
ISBN
978-3-319-21749-9
Pages
33 –41
DOI
10.1007/978-3-319-21750-5_3
Publisher site
See Chapter on Publisher Site

Abstract

[We present the computational complexity equivalence of Constraint Satisfaction Problem and solving systems of equations over unary algebras. We give detailed description of the polynomial transformation used both ways. We also prove that solving system of equations over arbitrary finite algebra is polynomially equivalent to solving system of equations over specially constructed unary algebra. Finally we show that if P is not equal to NP then the class of unary algebras for which solving systems of equations is solvable in a polynomial time is not closed under homomorphic images.]

Published: Jul 25, 2015

Keywords: ALGEBRA UNIV; Arbitrary Finite Algebra; Constraint Satisfaction Problem; Polynomial Transformation; Solvent System

There are no references for this article.