2-satisfiability

Results: 107



#Item
81Many 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.

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
82A Concurrent Portfolio Approach to SMT Solving Christoph M. Wintersteiger1 , Youssef Hamadi2 , and Leonardo de Moura3 1  2

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
83NuSMV 2: An OpenSource Tool for Symbolic Model Checking   

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
84Approximation Algorithms (ADM III)

Approximation Algorithms (ADM III)

Add to Reading List

Source URL: www.coga.tu-berlin.de

Language: English - Date: 2013-02-14 13:17:57
85The 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

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
86Phase transitions in NP-complete problems: a challenge for probability, combinatorics, and computer science Cristopher Moore University of New Mexico and the Santa Fe Institute

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
87Journal on Satisfiability, Boolean Modeling and Computation[removed]The Sat4j library, release 2.2 system description Daniel Le Berre∗ Anne Parrain

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
88Proving Dichotomy Theorems for Counting Problems  Jin-Yi Cai University of Wisconsin, Madison May 30, 2009

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
89Graph Homomorphisms with Complex Values: A Complete Dichotomy Theorem Jin-Yi Cai University of Wisconsin, Madison

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
90Dichotomy Theorems for Counting Problems  Jin-Yi Cai University of Wisconsin, Madison Xi Chen Columbia University

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