- 5 Résultats
prix le plus bas: € 53,09, prix le plus élevé: € 111,08, prix moyen: € 82,05
1
Theory and Applications of Satisfiability Testing - SAT 2010 - Ofer Strichman
Commander
sur booklooker.de
€ 96,29
Envoi: € 0,001
CommanderLien sponsorisé
Ofer Strichman:

Theory and Applications of Satisfiability Testing - SAT 2010 - Livres de poche

2010, ISBN: 9783642141850

[ED: Taschenbuch], [PU: Springer-Verlag GmbH], Neuware - This volume contains the papers presented at SAT 2010, the 13th International Conference on Theory and Applications of Satis abili… Plus…

Frais d'envoiVersandkostenfrei, Versand nach Deutschland. (EUR 0.00) Buchhandlung Hoffmann
2
Theory and Applications of Satisfiability Testing - SAT 2010 - Ofer Strichman; Stefan Szeider
Commander
sur lehmanns.de
€ 53,49
Envoi: € 0,001
CommanderLien sponsorisé

Ofer Strichman; Stefan Szeider:

Theory and Applications of Satisfiability Testing - SAT 2010 - Première édition

2010, ISBN: 9783642141850

Livres de poche

13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010, Proceedings, Buch, Softcover, This volume contains the papers presented at SAT 2010, the 13th International Confe… Plus…

Frais d'envoiVersand in 10-14 Tagen. (EUR 0.00)
3
Theory and Applications of Satisfiability Testing - SAT 2010: 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010, Proceedings (Lecture Notes in Computer Science, 6175, Band 6175)
Commander
sur amazon.de
€ 53,09
Envoi: € 3,001
CommanderLien sponsorisé
Theory and Applications of Satisfiability Testing - SAT 2010: 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010, Proceedings (Lecture Notes in Computer Science, 6175, Band 6175) - Livres de poche

2010

ISBN: 9783642141850

Springer, Taschenbuch, Auflage: 2010, 413 Seiten, Publiziert: 2010-06-30T00:00:01Z, Produktgruppe: Buch, Hersteller-Nr.: Illustrations, 1.39 kg, Informatik, IT-Ausbildung & -Berufe, Compu… Plus…

Frais d'envoiDie angegebenen Versandkosten können von den tatsächlichen Kosten abweichen. (EUR 3.00)
4
Commander
sur AbeBooks.de
€ 111,08
Envoi: € 9,341
CommanderLien sponsorisé
Ofer Strichman:
Theory and Applications of Satisfiability Testing SAT 2010 13th International Conference, SAT 2010, Edinburgh, UK, July 1114, 2010, Proceedings 6175 Lecture Notes in Computer Science, 6175 - Livres de poche

2010, ISBN: 3642141854

[EAN: 9783642141850], Neubuch, [PU: Springer], New Book. Shipped from UK. Established seller since 2000., Books

NEW BOOK. Frais d'envoi EUR 9.34 PBShop.store UK, Fairford, GLOS, United Kingdom [190245] [Rating: 5 (von 5)]
5
Commander
sur lehmanns.de
€ 96,29
Envoi: € 0,001
CommanderLien sponsorisé
Ofer Strichman; Stefan Szeider:
Theory and Applications of Satisfiability Testing - SAT 2010 - Livres de poche

2010, ISBN: 9783642141850

13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010, Proceedings, Buch, Softcover, [PU: Springer Berlin], Springer Berlin, 2010

Frais d'envoisofort lieferbar. (EUR 0.00)

1Comme certaines plateformes ne transmettent pas les conditions d'expédition et que celles-ci peuvent dépendre du pays de livraison, du prix d'achat, du poids et de la taille de l'article, d'une éventuelle adhésion de la plateforme, d'une livraison directe par la plateforme ou via un prestataire tiers (Marketplace), etc. il est possible que les frais de livraison indiqués par eurolivre ne correspondent pas à ceux de la plateforme qui propose l'article.

Données bibliographiques du meilleur livre correspondant

Détails sur le livre
Theory and Applications of Satisfiability Testing - SAT 2010

This book constitutes the refereed proceedings of the 13th International Conference on Theory and Applications of Satisfiability Testing, SAT 2010, held in Edinburgh, UK, in July 2010 as part of the Federated Logic Conference, FLoC 2010. The 21 revised full papers presented together with 14 revised short papers and 2 invited talks were carefully selected from 75 submissions. The papers cover a broad range of topics such as proof systems and proof complexity; search algorithms and heuristics; analysis of algorithms; combinatorial theory of satisfiability; random instances vs structured instances; problem encodings; industrial applications; applications to combinatorics; solvers, simplifiers and tools; and exact and parameterized algorithms.

Informations détaillées sur le livre - Theory and Applications of Satisfiability Testing - SAT 2010


EAN (ISBN-13): 9783642141850
ISBN (ISBN-10): 3642141854
Version reliée
Livre de poche
Date de parution: 2010
Editeur: Springer Berlin
400 Pages
Poids: 0,626 kg
Langue: eng/Englisch

Livre dans la base de données depuis 2007-03-09T00:06:16+01:00 (Paris)
Page de détail modifiée en dernier sur 2024-03-04T14:16:34+01:00 (Paris)
ISBN/EAN: 9783642141850

ISBN - Autres types d'écriture:
3-642-14185-4, 978-3-642-14185-0
Autres types d'écriture et termes associés:
Auteur du livre: strich
Titre du livre: edinburgh 2010, applications theory, international testing, test 2010


Données de l'éditeur

Auteur: Ofer Strichman; Stefan Szeider
Titre: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues; Theory and Applications of Satisfiability Testing - SAT 2010 - 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010, Proceedings
Editeur: Springer; Springer Berlin
400 Pages
Date de parution: 2010-06-30
Berlin; Heidelberg; DE
Langue: Anglais
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
XIII, 400 p. 74 illus.

BC; Hardcover, Softcover / Mathematik/Wahrscheinlichkeitstheorie, Stochastik, Mathematische Statistik; Algorithmen und Datenstrukturen; Verstehen; Informatik; MiniSAT; SAT algorithms; SAT complexity; SAT translation; algorithms; combinatorics; complexity; computational complexity; distributed algorithms; k-SAT; logic; polynomial time reduction; proof complexity; satisfiability testing; structured analysis; algorithm analysis and problem complexity; Algorithms; Software Engineering; Programming Techniques; Computer Science Logic and Foundations of Programming; Formal Languages and Automata Theory; Mathematics of Computing; Software Engineering; Computerprogrammierung und Softwareentwicklung; Theoretische Informatik; Mathematik für Informatiker; EA

1. Invited Talks.- The Big Deal: Applying Constraint Satisfaction Technologies Where It Makes the Difference.- Exact Algorithms and Complexity.- 2. Regular Papers.- Improving Stochastic Local Search for SAT with a New Probability Distribution.- Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas.- Proof Complexity of Propositional Default Logic.- Automated Testing and Debugging of SAT and QBF Solvers.- Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN.- Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT.- sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning.- Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold.- Symmetry and Satisfiability: An Update.- A Non-prenex, Non-clausal QBF Solver with Game-State Learning.- SAT Solving with Reference Points.- Integrating Dependency Schemes in Search-Based QBF Solvers.- An Exact Algorithm for the Boolean Connectivity Problem for k-CNF.- Improving Unsatisfiability-Based Algorithms for Boolean Optimization.- Encoding Techniques, Craig Interpolants and Bounded Model Checking for Incomplete Designs.- Statistical Methodology for Comparison of SAT Solvers.- On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem.- The Seventh QBF Solvers Evaluation (QBFEVAL’10).- Complexity Results for Linear XSAT-Problems.- Bounds on Threshold of Regular Random k-SAT.- Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT.- 3. Short Papers.- Improved Local Search for Circuit Satisfiability.- A System for Solving Constraint Satisfaction Problems with SMT.- Two Techniques for Minimizing Resolution Proofs.- On Moderately Exponential Time for SAT.- MinimisingDeterministic Büchi Automata Precisely Using SAT Solving.- Exploiting Circuit Representations in QBF Solving.- Reconstructing Solutions after Blocked Clause Elimination.- An Empirical Study of Optimal Noise and Runtime Distributions in Local Search.- Green-Tao Numbers and SAT.- Exact MinSAT Solving.- Uniquely Satisfiable k-SAT Instances with Almost Minimal Occurrences of Each Variable.- Assignment Stack Shrinking.- Simple but Hard Mixed Horn Formulas.- Zero-One Designs Produce Small Hard SAT Instances.

< pour archiver...