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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
