2-satisfiability - PDFSEARCH.IO - Document Search Engine

2-satisfiability
Results: 107

#	Item
71	Towards Ultra Rapid Restarts! Shai Haim1 and Marijn Heule 2 1 University of New South Wales and NICTA, Sydney, Australia 2 Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2011-02-20 08:31:36 Operations research Constraint programming Boolean algebra Logic in computer science Mathematical optimization Boolean satisfiability problem GRASP Solver Sol Theoretical computer science Applied mathematics Mathematics
72	JEONG HAN KIM, Microsoft Research Phase Transitions in a random NK landscape Model and a random 3-SAT problem We analyze the satisfiability problem of a certain random 3-SAT problem in which the appearances of 3-clauses Add to Reading List Source URL: cms.math.ca Language: English - Date: 2006-07-10 21:18:21 Logic in computer science Population genetics 2-satisfiability Fitness landscape Boolean satisfiability problem NK model Solubility Theoretical computer science Mathematics Applied mathematics
73	On the Gap between the Complexity of SAT and Minimization for Certain Classes of Boolean Formulas ˇ ˇ Ondˇrej Cepek and Stefan Add to Reading List Source URL: www.cs.uic.edu Language: English - Date: 2013-12-21 14:10:02 Logic in computer science Boolean algebra Complexity classes NP-complete problems Conjunctive normal form Computational problems 2-satisfiability Boolean satisfiability problem Disjunctive normal form Theoretical computer science Computational complexity theory Applied mathematics
74	The Chaos Within Sudoku M´ aria Ercsey-Ravasz1, ∗ and Zolt´an Toroczkai2, 3, † arXiv:1208.0370v1 [nlin.CD] 1 Aug 2012 Add to Reading List Source URL: arxiv.org Language: English - Date: 2012-08-02 20:18:34 NP-complete problems Logic puzzles Recreational mathematics Constraint programming Logic in computer science 2-satisfiability Sudoku Constraint satisfaction Boolean satisfiability problem Theoretical computer science Mathematics Computational complexity theory
75	metaSMT: A Unified Interface to SMT-LIB2 Heinz Riener1 Mathias Soeken1,2 Clemens Werther1 Add to Reading List Source URL: www.informatik.uni-bremen.de Language: English - Date: 2014-07-29 13:06:58 Electronic design automation Formal methods Logic in computer science Constraint programming Satisfiability Modulo Theories Solver Boolean satisfiability problem Timeout Transmission Control Protocol Theoretical computer science Applied mathematics NP-complete problems
76	Computational Complexity of SAT, XSAT and NAE-SAT for linear and mixed Horn CNF formulas Inaugural-Dissertation zur Erlangung des Doktorgrades Add to Reading List Source URL: kups.ub.uni-koeln.de Language: English - Date: 2011-03-28 06:57:24 NP-complete problems Logic in computer science Complexity classes Boolean algebra 2-satisfiability Boolean satisfiability problem Conjunctive normal form Outerplanar graph Planar graph Theoretical computer science Graph theory Computational complexity theory
77	Conflict-Guided Simplification for SAT Michael L. Case1,2 , Sanjit A. Seshia1 , Alan Mishchenko1 , and Robert K. Brayton1 1 2 Add to Reading List Source URL: www.bvsrc.org Language: English - Date: 2008-01-31 13:42:07 Logic in computer science NP-complete problems Automated theorem proving Constraint programming Electronic design automation Boolean satisfiability problem Resolution Conjunctive normal form Satisfiability Modulo Theories Theoretical computer science Mathematics Applied mathematics
78	Cut-Based Inductive Invariant Computation Michael Case1,2 1 Alan Mishchenko1 Add to Reading List Source URL: www.bvsrc.org Language: English - Date: 2008-04-28 18:02:46 Formal methods Logic in computer science Electronic design automation Mathematical logic Programming paradigms And-inverter graph Logic programming Model checking Boolean satisfiability problem Theoretical computer science Mathematics Applied mathematics
79	Knowing Minimum/Maximum n Formulae 1 and Natasha Alechina 2 ˚ Thomas Agotnes Abstract. We introduce a logical language with nullary operators min(n), for each non-negative integer n, which mean ‘the reasoner has at l Add to Reading List Source URL: www.cs.nott.ac.uk Language: English - Date: 2009-09-20 10:32:05 Metalogic Interpretation First-order logic Modal logic Epistemic modal logic Structure Well-formed formula Satisfiability Linear temporal logic Logic Model theory Mathematical logic
80	Many Hard Examples in Exact Phase Transitions with Application to Generating Hard Satisfiable Instances1 Ke Xu and Wei Li National Lab of Software Development Environment Department of Computer Science Beihang University Add to Reading List Source URL: www.nlsde.buaa.edu.cn Language: English - Date: 2005-04-26 04:16:28 Mathematics Constraint satisfaction problem 2-satisfiability Boolean satisfiability problem Constraint satisfaction Local search Constraint programming Theoretical computer science Applied mathematics

UPDATE