Theory and Applications of Satisfiability Testing: 7th International Conference, SAT 2004, Vancouver, BC, Canada, May 10-13, 2004, Revised Selected Papers: Lecture Notes in Computer Science, cartea 3542
Editat de Holger H. Hoos, David G. Mitchellen Limba Engleză Paperback – 8 iul 2005
Din seria Lecture Notes in Computer Science
- 20% Preț: 1053.72 lei
- 20% Preț: 337.82 lei
- 20% Preț: 339.43 lei
- 20% Preț: 449.99 lei
- 20% Preț: 238.01 lei
- 20% Preț: 337.82 lei
- 20% Preț: 438.69 lei
- Preț: 446.28 lei
- 20% Preț: 341.10 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 640.52 lei
- 17% Preț: 427.22 lei
- 20% Preț: 650.20 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1067.33 lei
- 20% Preț: 587.17 lei
- Preț: 378.43 lei
- 20% Preț: 334.54 lei
- 15% Preț: 435.36 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1404.34 lei
- 20% Preț: 1016.88 lei
- 20% Preț: 575.04 lei
- 20% Preț: 575.48 lei
- 20% Preț: 579.12 lei
- 20% Preț: 757.61 lei
- 15% Preț: 576.20 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 350.92 lei
- 20% Preț: 581.57 lei
- Preț: 407.85 lei
- 20% Preț: 592.06 lei
- 20% Preț: 757.61 lei
- 20% Preț: 819.86 lei
- 20% Preț: 649.49 lei
- 20% Preț: 347.62 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 335.69 lei
Preț vechi: 419.60 lei
-20% Nou
Puncte Express: 504
Preț estimativ în valută:
64.28€ • 66.31$ • 53.27£
64.28€ • 66.31$ • 53.27£
Carte tipărită la comandă
Livrare economică 21 februarie-07 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540278290
ISBN-10: 354027829X
Pagini: 412
Ilustrații: XIII, 393 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.58 kg
Ediția:2005
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 354027829X
Pagini: 412
Ilustrații: XIII, 393 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.58 kg
Ediția:2005
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables.- Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables.- A SAT-Based Decision Procedure for the Boolean Combination of Difference Constraints.- An Algebraic Approach to the Complexity of Generalized Conjunctive Queries.- Incremental Compilation-to-SAT Procedures.- Resolve and Expand.- Looking Algebraically at Tractable Quantified Boolean Formulas.- Derandomization of Schuler’s Algorithm for SAT.- Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank.- QBF Reasoning on Real-World Instances.- Automatic Extraction of Functional Dependencies.- Algorithms for Satisfiability Using Independent Sets of Variables.- Aligning CNF- and Equivalence-Reasoning.- Using DPLL for Efficient OBDD Construction.- Approximation Algorithm for Random MAX-kSAT.- Clause Form Conversions for Boolean Circuits.- From Spin Glasses to Hard Satisfiable Formulas.- CirCUs: A Hybrid Satisfiability Solver.- Equivalence Models for Quantified Boolean Formulas.- Search vs. Symbolic Techniques in Satisfiability Solving.- Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems.- Satisfiability Threshold of the Skewed Random k-SAT.- NiVER: Non-increasing Variable Elimination Resolution for Preprocessing SAT Instances.- Analysis of Search Based Algorithms for Satisfiability of Propositional and Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems.- UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT and MAX-SAT.- SAT Solver Competition and QBF Solver Evaluation (Invited Papers).- Fifty-Five Solvers in Vancouver: The SAT 2004 Competition.- March_eq: Implementing Additional Reasoning into an Efficient Look-Ahead SATSolver.- Zchaff2004: An Efficient SAT Solver.- The Second QBF Solvers Comparative Evaluation.