Exact Algorithms for Constraint Satisfaction Problems / Najlacnejšie knihy
Exact Algorithms for Constraint Satisfaction Problems

Code: 43264735

Exact Algorithms for Constraint Satisfaction Problems

by Moser, Robin

The Boolean satisfiability problem (SAT) and its generalization to variables of higher arities - constraint satisfaction problems (CSP) - can arguably be called the most "natural" of all NP-complete problems. The present work is c ... more

62.30

Availability:

50/50We think title might be available. Upon your order we will do our best to get it within 6 weeks.
We search the world

Availability alert

Add to wishlist

You might also like

Give this book as a present today
  1. Order book and choose Gift Order.
  2. We will send you book gift voucher at once. You can give it out to anyone.
  3. Book will be send to donee, nothing more to care about.

Book gift voucher sampleRead more

Availability alert

Availability alert


Your agreement - Submiting you agree to the Terms and Condtions.

We will watch availability for you

Enter your e-mail address and once book will be available,
we will send you a message. It's that simple.

More about Exact Algorithms for Constraint Satisfaction Problems

You get 151 loyalty points

Book synopsis

The Boolean satisfiability problem (SAT) and its generalization to variables of higher arities - constraint satisfaction problems (CSP) - can arguably be called the most "natural" of all NP-complete problems. The present work is concerned with their algori

Book details

62.30



Collection points Bratislava a 12441 dalších

Copyright ©2008-26 najlacnejsie-knihy.sk All rights reservedPrivacyCookies


Account: Log in
Všetky knihy sveta na jednom mieste. Navyše za skvelé ceny.

Shopping cart ( Empty )

For free shipping
shop for 59,99 € and more

You are here: