Computational complexity of solving equation systems [electronic resource]

• 作者： Broniek, Przemyslaw.
• 其他作者：
  • SpringerLink (Online service)
• 其他題名：
  • Springerbriefs in philosophy,
• 出版： Cham : Springer International Publishing :Imprint: Springer
• 叢書名： Springerbriefs in philosophy,
• 主題： Computational complexity , Equations--Numerical solutions , Computer science , Algorithm Analysis and Problem Complexity. , Logic , Mathematical Logic and Foundations.
• ISBN： 9783319217505 (electronic bk.) 、 9783319217499 (paper)
• FIND@SFXID: CGU
• 資料類型: 電子書
• 內容註: Acknowledgments -- Chapter 1. Introduction -- Chapter 2. Unary algebras -- Chapter 3. Reducing CSP to SYSTERMSAT over unary algebras -- Chapter 4. Partial characterizations -- Chapter 5. Conclusions and Open Problems.
• More
• 摘要註: This volume considers the computational complexity of determining whether a system of equations over a fixed algebra A has a solution. It examines in detail the two problems this leads to: SysTermSat(A) and SysPolSat(A), in which equations are built out of terms or polynomials, respectively. The book characterizes those algebras for which SysPolSat can be solved in a polynomial time. So far, studies and their outcomes have not covered algebras that generate a variety admitting type 1 in the sense of Tame Congruence Theory. Since unary algebras admit only type 1, this book focuses on these algebras to tackle the main problem. It discusses several aspects of unary algebras and proves that the Constraint Satisfaction Problem for relational structures is polynomially equivalent to SysTermSat over unary algebras. The book's final chapters discuss partial characterizations, present conclusions, and describe the problems that are still open.
• 讀者標籤：

  需登入
• 引用連結：

  Copy Link
• 目前引用數
• Share: