2-satisfiability

Results: 107



#Item
91Logic in computer science / NP-complete problems / Boolean algebra / Constraint programming / Electronic design automation / Maximum satisfiability problem / Boolean satisfiability problem / 2-satisfiability / Resolution / Theoretical computer science / Mathematics / Applied mathematics

Journal on Satisfiability, Boolean Modeling and Computation[removed] The First and Second Max-SAT Evaluations Josep Argelich [removed]

Add to Reading List

Source URL: jsat.ewi.tudelft.nl

Language: English - Date: 2008-10-01 08:14:56
92Morphisms / Category / Sheaf / Epimorphism / Initial and terminal objects / Graph rewriting / Additive category / Multicategory / Abstract algebra / Mathematics / Category theory

GT-VC[removed]An Algorithm for Approximating the Satisfiability Problem of High-level Conditions (Long Version) 1,2

Add to Reading List

Source URL: formale-sprachen.informatik.uni-oldenburg.de

Language: English - Date: 2007-08-08 08:19:07
93Electronic design automation / Formal methods / Logic in computer science / NP-complete problems / Boolean algebra / Lookup table / Satisfiability Modulo Theories / FO / Boolean satisfiability problem / Theoretical computer science / Logic / Mathematical logic

A Quantifier Elimination Algorithm for Linear Modular Equations and Disequations ⋆ Ajith K John1 and Supratik Chakraborty2 1 2

Add to Reading List

Source URL: www.cse.iitb.ac.in

Language: English - Date: 2012-06-17 16:38:49
94Constraint programming / Computational complexity theory / Constraint satisfaction problem / 2-satisfiability / Constraint satisfaction / Approximation algorithm / Logic in computer science / Combinatorial optimization / Linear programming / Theoretical computer science / Applied mathematics / Mathematics

Every 2-CSP allows nontrivial approximation Johan H˚ astad Royal Institute of Technology

Add to Reading List

Source URL: www.nada.kth.se

Language: English - Date: 2005-06-22 08:43:27
95NP-complete problems / Combinatorial optimization / Operations research / Cut / Graph connectivity / Maximum cut / Approximation algorithm / Semidefinite programming / 2-satisfiability / Theoretical computer science / Computational complexity theory / Mathematics

CSPs Classical results Semi-Definite programming Inapproximability results Classification Unique games

Add to Reading List

Source URL: www.nada.kth.se

Language: English - Date: 2007-09-24 02:48:52
96Logic in computer science / NP-complete problems / Boolean algebra / Boolean satisfiability problem / Electronic design automation / Conjunctive normal form / Maximum satisfiability problem / Satisfiability / 2-satisfiability / Theoretical computer science / Mathematics / Applied mathematics

Satisfiability Suggested Format Last revision: May 8, 1993

Add to Reading List

Source URL: www.domagoj-babic.com

Language: English - Date: 2008-09-07 21:05:56
97Logic / Boolean algebra / Propositional formula / IP / 2-satisfiability / Theoretical computer science / Computational complexity theory / Conjunctive normal form

Clause Form Conversions for Boolean Circuits Paul Jackson and Daniel Sheridan School of Informatics,

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Language: English - Date: 2005-05-20 12:27:00
98NP-complete problems / Logic in computer science / Exponential time hypothesis / 2-satisfiability / Boolean satisfiability problem / Conjunctive normal form / Time complexity / Parameterized complexity / Dominating set / Theoretical computer science / Computational complexity theory / Applied mathematics

On the possibility of faster SAT algorithms Mihai Pˇatra¸scu∗ AT&T Labs

Add to Reading List

Source URL: www.cs.cmu.edu

Language: English - Date: 2009-11-12 23:47:30
99Graph drawing / Topological graph theory / Angular resolution / 2-satisfiability / Planar graph / Graph / Connectivity / Point location / Graph embedding / Graph theory / Mathematics / Theoretical computer science

Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 11, no. 1, pp. 145–[removed])

Add to Reading List

Source URL: jgaa.info

Language: English - Date: 2007-07-16 05:39:01
100NP-complete problems / Complexity classes / Logic in computer science / Boolean algebra / Boolean satisfiability problem / Electronic design automation / 2-satisfiability / NP-complete / NP / Theoretical computer science / Computational complexity theory / Applied mathematics

Theory of Computation Chapter 9 Guan-Shieng Huang

Add to Reading List

Source URL: staffweb.ncnu.edu.tw

Language: English - Date: 2004-02-15 23:56:23
UPDATE