2-satisfiability - PDFSEARCH.IO - Document Search Engine

2-satisfiability
Results: 107

#	Item
41	—PREPRINT— Cooled and Relaxed Survey Propagation for MRFs Hai Leong Chieu1,2 , Wee Sun Lee2 1 Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2007-10-02 20:48:46 Graph theory Probability theory Belief propagation Coding theory Factor graph Independence Boolean satisfiability problem Theoretical computer science Graphical models Mathematics
42	νZ - Maximal Satisfaction with Z3 Nikolaj Bjørner1 and Anh-Dung Phan2∗ 1 2 Microsoft Research Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2014-10-16 19:21:04 Formal methods Constraint programming Electronic design automation Logic in computer science NP-complete problems Satisfiability Modulo Theories Boolean satisfiability problem Linear programming Mathematical optimization Theoretical computer science Applied mathematics Mathematics
43	Under consideration for publication in Math. Struct. in Comp. Science Applications and Extensions of Alloy: Past, Present, and Future E M I N A T O R L A K 1 , M A N A T A G H D I R I 2 , G R E G D E N N I S 3 and J O S Add to Reading List Source URL: homes.cs.washington.edu Language: English - Date: 2014-08-13 19:26:58 Model checkers Logic in computer science Alloy Analyzer Massachusetts Institute of Technology Alloy NuSMV Formal verification First-order logic Boolean satisfiability problem Theoretical computer science Formal methods Applied mathematics
44	CCCG 2009, Vancouver, BC, August 17–19, 2009 Inapproximability of the Perimeter Defense Problem Evangelos Kranakis∗ Danny Krizanc† Add to Reading List Source URL: cccg.ca Language: English - Date: 2009-09-02 14:33:48 Computational complexity theory Simple polygon 2-satisfiability Rectilinear polygon Optimization problem APX Vertex Theoretical computer science Polygons Geometry
45	A Fast Algorithm for Point Labeling Problem Sasanka Roy∗ Subhasis Bhattacharjee∗ Subhas C. Nandy Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2005-08-05 21:28:00 NP-complete problems Combinatorial optimization 2-satisfiability Independent set Matching Automatic label placement Algorithm Dominating set Partial cube Theoretical computer science Mathematics Graph theory
46	Randomized and Parameterized Algorithms for the Closest String Problem Zhi-Zhong Chen Tokyo Denki University Joint with Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2014-06-14 17:20:02 Analysis of algorithms NP-complete problems Closest string Randomized algorithm String Time complexity Algorithm 2-satisfiability NP Theoretical computer science Computational complexity theory Applied mathematics
47	Combining Component Caching and Clause Learning for Effective Model Counting Tian Sang1 , Fahiem Bacchus2 , Paul Beame1 , Henry Kautz 1 , and Toniann Pitassi 2 1 Computer Science and Engineering, University of Washingto Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2004-04-13 00:26:28 NP-complete problems Automated theorem proving Constraint programming Boolean algebra Formal methods DPLL algorithm Boolean satisfiability problem Conjunctive normal form Lookup table Theoretical computer science Applied mathematics Mathematics
48	doi:j.ipl Add to Reading List Source URL: www.cc.ntut.edu.tw Language: English - Date: 2008-03-02 23:12:13 Automated theorem proving NP-complete problems Unit propagation 2-satisfiability Time complexity Variable MAX-3SAT (SAT ε-UNSAT) Theoretical computer science Mathematics Computational complexity theory
49	Chicago Journal of Theoretical Computer Science The MIT Press Volume 1999, Article 11 Satisfiability Coding Lemma ISSN 1073–0486. MIT Press Journals, Five Cambridge Center, Cambridge, Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2000-02-20 22:53:43 NP-complete problems Conjunctive normal form Combinatorics Boolean satisfiability problem String Permutation PP 2-satisfiability MAX-3SAT Theoretical computer science Mathematics Computational complexity theory
50	Co-Clustering Under the Maximum Norm Laurent Bulteau? , Vincent Froese?? , Sepp Hartung, and Rolf Niedermeier Institut f¨ ur Softwaretechnik und Theoretische Informatik, TU Berlin, Germany , Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-09-11 10:18:15 Biclustering 2-satisfiability NP Matrix Permutation Consensus clustering Complete-linkage clustering Statistics Cluster analysis Mathematics

UPDATE