2-satisfiability - PDFSEARCH.IO - Document Search Engine

2-satisfiability
Results: 107

#	Item
81	Many Hard Examples in Exact Phase Transitions1 Ke Xu and Wei Li National Lab of Software Development Environment Department of Computer Science Beihang University, Beijing[removed], China Email:{kexu,liwei}@nlsde.buaa.edu. Add to Reading List Source URL: www.nlsde.buaa.edu.cn Language: English - Date: 2006-01-02 10:31:48 Mathematics Constraint satisfaction problem 2-satisfiability Constraint satisfaction Boolean satisfiability problem Constraint programming Theoretical computer science Applied mathematics
82	A Concurrent Portfolio Approach to SMT Solving Christoph M. Wintersteiger1 , Youssef Hamadi2 , and Leonardo de Moura3 1 2 Add to Reading List Source URL: www.winterstiger.at Language: English - Date: 2009-05-09 06:17:01 Applied mathematics Logic in computer science Electronic design automation Formal methods NP-complete problems Satisfiability Modulo Theories Speedup Z3 OpenMP Theoretical computer science Computing Parallel computing
83	NuSMV 2: An OpenSource Tool for Symbolic Model Checking Add to Reading List Source URL: nusmv.fbk.eu Language: English - Date: 2002-07-09 12:35:04 Applied mathematics Formal methods Software Logic in computer science Model checking Electronic design automation Boolean algebra Boolean satisfiability problem Linear temporal logic Model checkers Theoretical computer science NuSMV
84	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2013-02-14 13:17:57 Probabilistic complexity theory Structural complexity theory NP-complete problems Approximation algorithms 2-satisfiability L-reduction Reduction PCP theorem Probabilistically checkable proof Theoretical computer science Applied mathematics Computational complexity theory
85	The Power of Choice in Random Satisfiability Varsha Dani, University of New Mexico Josep Díaz, Universitat Politècnica de Catalunya Thomas Hayes, University of New Mexico Cristopher Moore, Santa Fe Institute Add to Reading List Source URL: tuvalu.santafe.edu Language: English - Date: 2013-08-24 21:10:43 NP-complete problems Automated theorem proving Logic in computer science Boolean algebra Boolean satisfiability problem Electronic design automation 2-satisfiability Unit propagation Clause Theoretical computer science Mathematics Applied mathematics
86	Phase transitions in NP-complete problems: a challenge for probability, combinatorics, and computer science Cristopher Moore University of New Mexico and the Santa Fe Institute Add to Reading List Source URL: tuvalu.santafe.edu Language: English - Date: 2010-10-12 20:57:56 Complexity classes Mathematical optimization NP-complete problems Structural complexity theory NP-complete NP Boolean satisfiability problem P versus NP problem 2-satisfiability Theoretical computer science Computational complexity theory Applied mathematics
87	Journal on Satisfiability, Boolean Modeling and Computation[removed]The Sat4j library, release 2.2 system description Daniel Le Berre∗ Anne Parrain Add to Reading List Source URL: jsat.ewi.tudelft.nl Language: English - Date: 2010-07-09 05:53:23 Logic in computer science Electronic design automation Formal methods NP-complete problems Boolean satisfiability problem Solver Satz ECLiPSe Unsatisfiable core Theoretical computer science Applied mathematics Constraint programming
88	Proving Dichotomy Theorems for Counting Problems Jin-Yi Cai University of Wisconsin, Madison May 30, 2009 Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2010-12-31 10:44:44 Graph homomorphism Matching 2-satisfiability Bipartite graph Counting problem Constraint satisfaction problem Holographic algorithm Graph NP-complete Theoretical computer science Mathematics Graph theory
89	Graph Homomorphisms with Complex Values: A Complete Dichotomy Theorem Jin-Yi Cai University of Wisconsin, Madison Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2011-07-14 02:22:40 Graph theory NP-complete problems Graph coloring Constraint programming Complexity classes 2-satisfiability Graph homomorphism NP-complete Matching Theoretical computer science Mathematics Computational complexity theory
90	Dichotomy Theorems for Counting Problems Jin-Yi Cai University of Wisconsin, Madison Xi Chen Columbia University Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2011-07-11 20:52:11 Graph theory Computational problems NP-complete problems Constraint programming Graph coloring 2-satisfiability NP-complete Graph homomorphism Constraint satisfaction problem Theoretical computer science Mathematics Computational complexity theory

UPDATE