Computational Complexity of Solving Equation Systems (SpringerBriefs in Philosophy) - Softcover
Book 23 of 86: SpringerBriefs in Philosophy
Synopsis
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.
"synopsis" may belong to another edition of this title.
Search results for Computational Complexity of Solving Equation Systems...
Stock Image
Broniek:Computational Complexity of Sol (eng)
Print on DemandSeller: Brook Bookstore On Demand, Napoli, NA, Italy
Seller rating 4 out of 5 stars
Condition: new. Questo è un articolo print on demand. Seller Inventory # f13a0adf2d65344fa833f1561b0247f8
Buy New
US$ 55.85
US$ 12.90 shipping
Ships from Italy to U.S.A.
Ships from Italy to U.S.A.
Quantity: Over 20 available
Seller Image
Computational Complexity of Solving Equation Systems
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 24006163-n
Seller Image
Computational Complexity of Solving Equation Systems
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 24006163
Stock Image
Computational Complexity of Solving Equation Systems (SpringerBriefs in Philosophy)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783319217499_new
Buy New
US$ 68.39
US$ 16.24 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Computational Complexity of Solving Equation Systems (SpringerBriefs in Philosophy)
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. Seller Inventory # 6666-IUK-9783319217499
Buy New
US$ 65.99
US$ 21.00 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 10 available
Seller Image
Computational Complexity of Solving Equation Systems
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 24006163-n
Buy New
US$ 68.38
US$ 20.33 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Seller Image
Computational Complexity of Solving Equation Systems
Published by
Springer International Publishing Aug 2015, 2015
ISBN 10: 3319217496
ISBN 13: 9783319217499
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 76 pp. Englisch. Seller Inventory # 9783319217499
Buy New
US$ 64.63
US$ 26.98 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 2 available
Seller Image
Computational Complexity of Solving Equation Systems
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 24006163
Buy Used
US$ 76.41
US$ 20.33 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Computational Complexity of Solving Equation Systems
Published by
Springer-Verlag New York Inc, 2015
ISBN 10: 3319217496
ISBN 13: 9783319217499
New
Paperback
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Brand New. 120 pages. 9.00x6.00x0.25 inches. In Stock. Seller Inventory # x-3319217496
Buy New
US$ 86.74
US$ 20.33 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 2 available
Stock Image
Computational Complexity of Solving Equation Systems (SpringerBriefs in Philosophy)
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. pp. 120. Seller Inventory # 26372596264