Join thousands of book lovers
Sign up to our newsletter and receive discounts and inspiration for your next reading experience.
By signing up, you agree to our Privacy Policy.You can, at any time, unsubscribe from our newsletters.
Computational Complexity of Solving Equation Systems
part of the SpringerBriefs in Philosophy series
- Binding:
- Paperback
- Pages:
- 64
- Published:
- August 5, 2015
- Edition:
- 12015
- Dimensions:
- 155x235x4 mm.
- Weight:
- 1299 g.
Delivery:
1-2 weeks
Expected delivery: October 19, 2024
Description of Computational Complexity of Solving Equation Systems
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.
User ratings of Computational Complexity of Solving Equation Systems
Rate this book
In order to rate this book you must be logged in.Others also bought..
Find similar books
The book Computational Complexity of Solving Equation Systems can be found in the following categories:
You can, at any time, unsubscribe from our newsletters.
© 2024 Tales
All packages are shipped from our warehouse in the UK.
Company address: Esromgade 15, 3. - 2200 - DK
Registered company number: DK43351621
