Code: 43264735
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
English
62.30 €
Availability:
50/50
We think title might be available. Upon your order we will do our best to get it within 6 weeks.
Enter your e-mail address and once book will be available,
we will send you a message. It's that simple.
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 €
EnglishCollection points Bratislava a 12441 dalších
Copyright ©2008-26 najlacnejsie-knihy.sk All rights reservedPrivacyCookies
24886 collection points
Delivery 2.99 €
02/210 210 99 (8-15.30h)Shopping cart ( Empty )