Angebote zu "Complexity" (83 Treffer)

Kategorien

Shops

Computational Complexity of SAT, XSAT and NAE-SAT
79,90 € *
ggf. zzgl. Versand

The Boolean conjunctive normal form (CNF) satisability problem, called SAT for short, gets as input a CNF formula and has to decide whether this formula admits a satisfying truth assignment. As is well known, the remarkable result by S. Cook in 1971 established SAT as the first and genuine complete problem for the complexity class NP. In this thesis we consider SAT for a subclass of CNF, the so called Mixed Horn formula class (MHF). A formula F 2 MHF consists of a 2-CNF part P and a Horn part H. We propose that MHF has a central relevance in CNF because many prominent NP-complete problems, e.g. Feedback Vertex Set, Vertex Cover, Dominating Set and Hitting Set, can easily be encoded as MHF. Furthermore, we show that SAT remains NP-complete for some interesting subclasses of MHF. We also provide algorithms for some of these subclasses solving SAT in a better running time than O(2^0.5284n) which is the best bound for MHF so far. In addition, we investigate the computational complexity of some prominent variants of SAT, namely not-all-equal SAT (NAE-SAT) and exact SAT (XSAT) restricted to the class of linear CNF formulas.

Anbieter: Dodax
Stand: 25.01.2020
Zum Angebot
Schmidt, Tatjana: Computational Complexity of S...
79,90 € *
ggf. zzgl. Versand

Erscheinungsdatum: 28.06.2015, Medium: Taschenbuch, Einband: Kartoniert / Broschiert, Titel: Computational Complexity of SAT, XSAT and NAE-SAT, Titelzusatz: For linear and mixed Horn CNF formulas, Autor: Schmidt, Tatjana, Verlag: Südwestdeutscher Verlag für Hochschulschriften AG Co. KG, Sprache: Englisch, Rubrik: Naturwissenschaften // Technik allg., Seiten: 172, Informationen: Paperback, Gewicht: 272 gr, Verkäufer: averdo

Anbieter: averdo
Stand: 25.01.2020
Zum Angebot
Theory and Applications of Satisfiability Testi...
68,47 € *
ggf. zzgl. Versand

This book constitutes the refereed proceedings of the 18th International Conference on Theory and Applications of Satisfiability Testing, SAT 2015, held in Austin, TX, USA, in September 2015. The 21 regular papers, 2 short papers and 7 tool papers presented together with 3 invited talks were carefully reviewed and selected from 70 submissions. The papers address different aspects of SAT, including theoretical advances (exact algorithms, proof complexity, and other complexity issues), practical search algorithms, knowledge compilation, implementation-level details of SAT solvers and SAT-based systems, problem encodings and reformulations, and applications, as well as case studies and reports on insightful findings based on rigorous experimentation. The paper 'Constructing SAT Filters with a Quantum Annealer' is published open access under a CC BY-NC 2.5 license at link.springer.com.

Anbieter: Dodax
Stand: 25.01.2020
Zum Angebot
Theory and Applications of Satisfiability Testi...
65,55 € *
ggf. zzgl. Versand

This book constitutes the refereed proceedings of the 22nd International Conference on Theory and Applications of Satisfiability Testing, SAT 2019, held in Lisbon, Portugal, UK, in July 2019.The 19 revised full papers presented together with 7 short papers were carefully reviewed and selected from 64 submissions. The papers address different aspects of SAT interpreted in a broad sense, including (but not restricted to) theoretical advances (such as exact algorithms, proof complexity, and other complexity issues), practical search algorithms, knowledge compilation, implementation-level details of SAT solvers and SAT-based systems, problem encodings and reformulations, applications (including both novel application domains and improvements to existing approaches), as well as case studies and reports on findings based on rigorous experimentation.

Anbieter: Dodax
Stand: 25.01.2020
Zum Angebot
Theory and Applications of Satisfiability Testi...
68,47 € *
ggf. zzgl. Versand

This book constitutes the refereed proceedings of the 18th International Conference on Theory and Applications of Satisfiability Testing, SAT 2015, held in Austin, TX, USA, in September 2015. The 21 regular papers, 2 short papers and 7 tool papers presented together with 3 invited talks were carefully reviewed and selected from 70 submissions. The papers address different aspects of SAT, including theoretical advances (exact algorithms, proof complexity, and other complexity issues), practical search algorithms, knowledge compilation, implementation-level details of SAT solvers and SAT-based systems, problem encodings and reformulations, and applications, as well as case studies and reports on insightful findings based on rigorous experimentation. The paper 'Constructing SAT Filters with a Quantum Annealer' is published open access under a CC BY-NC 2.5 license at link.springer.com.

Anbieter: Dodax AT
Stand: 25.01.2020
Zum Angebot
Theory and Applications of Satisfiability Testi...
67,19 € *
ggf. zzgl. Versand

This book constitutes the refereed proceedings of the 22nd International Conference on Theory and Applications of Satisfiability Testing, SAT 2019, held in Lisbon, Portugal, UK, in July 2019.The 19 revised full papers presented together with 7 short papers were carefully reviewed and selected from 64 submissions. The papers address different aspects of SAT interpreted in a broad sense, including (but not restricted to) theoretical advances (such as exact algorithms, proof complexity, and other complexity issues), practical search algorithms, knowledge compilation, implementation-level details of SAT solvers and SAT-based systems, problem encodings and reformulations, applications (including both novel application domains and improvements to existing approaches), as well as case studies and reports on findings based on rigorous experimentation.

Anbieter: Dodax AT
Stand: 25.01.2020
Zum Angebot
Theory and Applications of Satisfiability Testi...
71,98 € *
ggf. zzgl. Versand

This book constitutes the refereed proceedings of the 21st International Conference on Theory and Applications of Satisfiability Testing, SAT 2018, held in Oxford, UK, in July 2018.The 20 revised full papers, 4 short papers, and 2 tool papers were carefully reviewed and selected from 58 submissions. The papers address different aspects of SAT interpreted in a broad sense, including theoretical advances (such as exact algorithms, proof complexity, and other complexity issues), practical search algorithms, knowledge compilation, implementation-level details of SAT solvers and SAT-based systems, problem encodings and reformulations, applications as well as case studies and reports on findings based on rigorous experimentation. They are organized in the following topical sections: maximum satisfiability, conflict driven clause learning, model counting, quantified Boolean formulae, theory, minimally unsatisfiable sets, satisfiability modulo theories, and tools and applications.

Anbieter: Dodax
Stand: 25.01.2020
Zum Angebot
Theory and Applications of Satisfiability Testi...
80,49 € *
ggf. zzgl. Versand

This book constitutes the refereed proceedings of the 19th International Conference on Theory and Applications of Satisfiability Testing, SAT 2016, held in Bordeaux, France, in July 2016.The 31 regular papers, 5 tool papers presented together with 3 invited talks were carefully reviewed and selected from 70 submissions. The papers address different aspects of SAT, including complexity, satisfiability solving, satisfiability applications, satisfiability modulop theory, beyond SAT, quantified Boolean formula, and dependency QBF.

Anbieter: Dodax AT
Stand: 25.01.2020
Zum Angebot
Theory and Applications of Satisfiability Testi...
96,29 € *
ggf. zzgl. Versand

This volume contains the papers presented at SAT 2010, the 13th International Conference on Theory and Applications of Satis?ability Testing. SAT 2010 was held as part of the 2010 Federated Logic Conference (FLoC) and was hosted by the School of Informatics at the University of Edinburgh, Scotland. In addition to SAT, FLoC included the conferences CAV, CSF, ICLP, IJCAR, ITP, LICS, RTA, as well as over 50 workshops. A?liated with SAT were the workshops LaSh (Logic and Search, co-a?liated with ICLP), LoCoCo (Logics for C- ponent Con?guration), POS (Pragmatics Of SAT), PPC (Propositional Proof Complexity: Theory and Practice), and SMT (Satis?ability Modulo Theories, co-a?liated with CAV). SAT featured three competitions: the MAX-SAT Ev- uation 2010, the Pseudo-Boolean Competition 2010, and the SAT-Race 2010. Many hard combinatorial problems such as problems arising in veri?cation and planning can be naturally expressed within the framework of propositional satis?ability. Due to its wide applicability and enormous progress in the perf- mance of solving methods, satis?ability has become one of today s most imp- tant core technologies. The SAT 2010 call for papers invited the submission of original practical and theoretical research on satis?ability. Topics included but were not limited to proof systems and proof complexity, search algorithms and heuristics, analysis of algorithms, combinatorial theory of satis?ability, random instances vs structured instances, problem encodings, industrial applications, applicationsto combinatorics,solvers,simpli?ers andtools,casestudies and- piricalresults,exactandparameterizedalgorithms.

Anbieter: Dodax
Stand: 25.01.2020
Zum Angebot