|
|
Sold Out
Book Categories |
| Mapping problems with finite-domain variables to problems with Boolean variables | 1 | |
| A SAT-based decision procedure for the Boolean combination of difference constraints | 16 | |
| An algebraic approach to the complexity of generalized conjunctive queries | 30 | |
| Incremental compilation-to-SAT procedures | 46 | |
| Resolve and expand | 59 | |
| Looking algebraically at tractable quantified Boolean formulas | 71 | |
| Derandomization of Schuler's algorithm for SAT | 80 | |
| Polynomial time SAT decision, hypergraph transversals and the Hermitian rank | 89 | |
| QBF reasoning on real-world instances | 105 | |
| Automatic extraction of functional dependencies | 122 | |
| Algorithms for satisfiability using independent sets of variables | 133 | |
| Aligning CNF- and equivalence-reasoning | 145 | |
| Using DPLL for efficient OBDD construction | 157 | |
| Approximation algorithm for random MAX-kSAT | 173 | |
| Clause form conversions for Boolean circuits | 183 | |
| From spin glasses to hard satisfiable formulas | 199 | |
| CirCUs : a hybrid satisfiability solver | 211 | |
| Equivalence models for quantified Boolean formulas | 224 | |
| Search vs. symbolic techniques in satisfiability solving | 235 | |
| Worst case bounds for some NP-complete modified Horn-SAT problems | 251 | |
| Satisfiability threshold of the skewed random k-SAT | 263 | |
| NiVER : non-increasing variable elimination resolution for preprocessing SAT instances | 276 | |
| Analysis of search based algorithms for satisfiability of propositional and quantified Boolean formulas arising from circuit state space diameter problems | 292 | |
| UBCSAT : an implementation and experimentation environment for SLS algorithms for SAT and MAX-SAT | 306 | |
| Fifty-five solvers in Vancouver : the SAT 2004 competition | 321 | |
| Marchöeq : implementing additional reasoning into an efficient look-ahead SAT solver | 345 | |
| Zchaff2004 : an efficient SAT solver | 360 | |
| The second QBF solvers comparative evaluation | 376 |
| Price | Condition | Delivery | Seller | Action |
| $99.99 | Digital |
| WonderClub |
T J Minogue
reviewed Theory and Applications of Satisfiability Testing on March 31, 2017
Theory and Applications of Satisfiability Testing
In comparison to "Introduction to Algorithms" (the other algorithm book I had significant exposure to) this one is faster to read, easier to digest and more tailored towards applications.
I found the "Hitchhiker's Guide to Algorithms" in the back to be extremely useful if you really find yourself tackling an algorithmic problem in practice.
The main part (maybe skipping/skimming down a few chapters) is a very good preparation for algorithm-heavy job interviews (e.g. Google, Facebook etc ...).
Very much recommended.
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish List
X
This item is in your Collection
Theory and Applications of Satisfiability Testing
X
This Item is in Your Inventory
Theory and Applications of Satisfiability Testing
X
You must be logged in to review the productsX
X
X
Add Theory and Applications of Satisfiability Testing, , Theory and Applications of Satisfiability Testing to the inventory that you are selling on WonderClubX
X
Add Theory and Applications of Satisfiability Testing, , Theory and Applications of Satisfiability Testing to your collection on WonderClub |