85,59 € *

ggf. zzgl. Versand

ggf. zzgl. Versand

This book is a concise, self-contained, up-to-date introduction to extremal combinatorics for nonspecialists. There is a strong emphasis on theorems with particularly elegant and informative proofs, they may be called gems of the theory. The author presents a wide spectrum of the most powerful combinatorial tools together with impressive applications in computer science: methods of extremal set theory, the linear algebra method, the probabilistic method, and fragments of Ramsey theory. No special knowledge in combinatorics or computer science is assumed - the text is self-contained and the proofs can be enjoyed by undergraduate students in mathematics and computer science. Over 300 exercises of varying difficulty, and hints to their solution, complete the text.This second edition has been extended with substantial new material, and has been revised and updated throughout. It offers three new chapters on expander graphs and eigenvalues, the polynomial method and error-correcting codes. Most of the remaining chapters also include new material, such as the Kruskal-Katona theorem on shadows, the Lovász-Stein theorem on coverings, large cliques in dense graphs without induced 4-cycles, a new lower bounds argument for monotone formulas, Dvir's solution of the finite field Kakeya conjecture, Moser's algorithmic version of the Lovász Local Lemma, Schöning's algorithm for 3-SAT, the Szemerédi-Trotter theorem on the number of point-line incidences, surprising applications of expander graphs in extremal number theory, and some other new results.

Anbieter: Dodax

Stand: 03.04.2020 Zum Angebot

Stand: 03.04.2020 Zum Angebot

128,98 € *

ggf. zzgl. Versand

ggf. zzgl. Versand

This is the first book presenting a broad overview of parallelism in constraint-based reasoning formalisms. In recent years, an increasing number of contributions have been made on scaling constraint reasoning thanks to parallel architectures. The goal in this book is to overview these achievements in a concise way, assuming the reader is familiar with the classical, sequential background. It presents work demonstrating the use of multiple resources from single machine multi-core and GPU-based computations to very large scale distributed execution platforms up to 80,000 processing units.The contributions in the book cover the most important and recent contributions in parallel propositional satisfiability (SAT), maximum satisfiability (MaxSAT), quantified Boolean formulas (QBF), satisfiability modulo theory (SMT), theorem proving (TP), answer set programming (ASP), mixed integer linear programming (MILP), constraint programming (CP), stochastic local search (SLS), optimal path finding with A , model checking for linear-time temporal logic (MC/LTL), binary decision diagrams (BDD), and model-based diagnosis (MBD).The book is suitable for researchers, graduate students, advanced undergraduates, and practitioners who wish to learn about the state of the art in parallel constraint reasoning.

Anbieter: Dodax

Stand: 03.04.2020 Zum Angebot

Stand: 03.04.2020 Zum Angebot

74,89 € *

ggf. zzgl. Versand

ggf. zzgl. Versand

Anbieter: Dodax

Stand: 03.04.2020 Zum Angebot

Stand: 03.04.2020 Zum Angebot

68,96 € *

ggf. zzgl. Versand

ggf. zzgl. Versand

This book constitutes the refereed proceedings of the 7th International Symposium on NASA Formal Methods, NFM 2015, held in Pasadena, CA, USA, in April 2015.The 24 revised regular papers presented together with 9 short papers were carefully reviewed and selected from 108 submissions. The topics include model checking, theorem proving, SAT and SMT solving, symbolic execution, static analysis, runtime verification, systematic testing, program refinement, compositional verification, security and intrusion detection, modeling and specification formalisms, model-based development, model-based testing, requirement engineering, formal approaches to fault tolerance, and applications of formal methods.

Anbieter: Dodax

Stand: 03.04.2020 Zum Angebot

Stand: 03.04.2020 Zum Angebot

48,98 € *

ggf. zzgl. Versand

ggf. zzgl. Versand

This book is Open Access under a CC BY licence.The LNCS 11427 and 11428 proceedings set constitutes the proceedings of the 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2019, which took place in Prague, Czech Republic, in April 2019, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019.The total of 42 full and 8 short tool demo papers presented in these volumes was carefully reviewed and selected from 164 submissions. The papers are organized in topical sections as follows:Part I: SAT and SMT, SAT solving and theorem proving, verification and analysis, model checking, tool demo, and machine learning.Part II: concurrent and distributed systems, monitoring and runtime verification, hybrid and stochastic systems, synthesis, symbolic verification, and safety and fault-tolerant systems.

Anbieter: Dodax

Stand: 03.04.2020 Zum Angebot

Stand: 03.04.2020 Zum Angebot

48,98 € *

ggf. zzgl. Versand

ggf. zzgl. Versand

Anbieter: Dodax

Stand: 03.04.2020 Zum Angebot

Stand: 03.04.2020 Zum Angebot

29,90 CHF *

zzgl. 3,50 CHF Versand

zzgl. 3,50 CHF Versand

The development of new and improved proof systems, proof formats and proof search methods is one of the most essential goals of Logic. But what is a proof? What makes a proof better than another? How can a proof be found efficiently? How can a proof be used? Logicians from different communities usually provide radically different answers to such questions. Their principles may be folklore within their own communities but are often unknown to outsiders. This book provides a snapshot of the current state of the art in proof search and proof production as implemented in contemporary automated reasoning tools such as SAT-solvers, SMT-solvers, first-order and higher-order automated theorem provers and proof assistants. Furthermore, various trends in proof theory, such as the calculus of inductive constructions, deduction modulo, deep inference, foundational proof certificates and cut-elimination, are surveyed; and applications of formal proofs are illustrated in the areas of cryptography, verification and mathematical proof mining. Experts in these topics were invited to present tutorials about proofs during the Vienna Summer of Logic and the chapters in this book reflect their tutorials. Therefore, each chapter is intended to be accessible not only to experts but also to novice researchers from all fields of Logic.

Anbieter: Orell Fuessli CH

Stand: 03.04.2020 Zum Angebot

Stand: 03.04.2020 Zum Angebot

106,99 € *

ggf. zzgl. Versand

ggf. zzgl. Versand

Constraint satisfaction problems are a central pillar of modern computational complexity theory. This monograph provides an introduction to the rapidly growing field of Quantum Hamiltonian Complexity (QHC), which includes the study of quantum constraint satisfaction problems. Over the past decade and a half, this field has witnessed fundamental breakthroughs, ranging from the establishment of a Quantum Cook-Levin Theorem to deep insights into the structure of 1D low-temperature quantum systems via so-called area laws. Quantum Hamiltonian Complexity provides the reader with a computer science-oriented introduction to the subject in order to help bridge the language barrier between computer scientists and physicists in the field. As such, it includes the following: (1) The motivations and history of the field, (2) a glossary of condensed matter physics terms explained in computer-science friendly language, (3) overviews of central ideas from condensed matter physics, such as indistinguishable particles, mean field theory, tensor networks, and area laws, and (4) brief expositions of selected computer science-based results in the area. For example, as part of the latter, it provides a novel information theoretic presentation of Bravyi's polynomial time algorithm for Quantum 2-SAT. Quantum Hamiltonian Complexity reviews some of the most fundamental results in QHC and is an ideal reference for computer scientists with little or no background in quantum information.

Anbieter: Thalia AT

Stand: 03.04.2020 Zum Angebot

Stand: 03.04.2020 Zum Angebot

21,99 € *

ggf. zzgl. Versand

ggf. zzgl. Versand

Anbieter: Thalia AT

Stand: 03.04.2020 Zum Angebot

Stand: 03.04.2020 Zum Angebot