CSL Technical Report SRI-CSL-06-01 • May 23, 2006 Integrating Simplex with DPLL(T ) Bruno Dutertre and Leonardo de Moura This report is based upon work supported by the Defense Advanced Research Projects

Source URL: yices.csl.sri.com

• Theoretical computer science
• Computational complexity theory
• Mathematics
• Electronic design automation
• Formal methods
• Logic in computer science
• NP-complete problems
• Constraint programming
• Satisfiability modulo theories
• Boolean satisfiability problem
• Solver
• Simplex algorithm

An inequality concerning the expected values of row-sum and column-sum products in Boolean matrices J.B.Paris∗and A.Vencovsk´a† School of Mathematics The University of Manchester

Source URL: www.maths.manchester.ac.uk

Elementary IR: Scalable Boolean Text Search (Compare with R & G) Information Retrieval: History

Source URL: inst.eecs.berkeley.edu

Analysis of Boolean Functions (CMU 18-859S, SpringLecture 16: The Hypercontractivity Theorem Mar. 8, 2007

Source URL: www.cs.cmu.edu

An Improved Combinatorial Algorithm for Boolean Matrix Multiplication Huacheng Yu∗ Stanford University December 2, 2015

Source URL: theory.stanford.edu

Guest Lecture: Average Case depth hierarchy for ∧, ∨, ¬-Boolean circuits. Boaz Barak Thanks to the authors of RST for answering my questions by email and in particular to Li-Yang Tan for sharing with me his slides.

Source URL: www.boazbarak.org

1 Potassco: The Potsdam Answer Set Solving Collection Martin Gebser, Benjamin Kaufmann, Roland Kaminski, Max Ostrowski, Torsten Schaub, and Marius Schneider

Source URL: www.cs.uni-potsdam.de

• Logic programming
• NP-complete problems
• Operations research
• Constraint programming
• Answer set programming
• Logic in computer science
• Boolean satisfiability problem
• Algorithm
• Solver
• Stable model semantics
• AMPL
• Constraint satisfaction problem

February 3, 2009 COM S 6810 Theory of Computing Lecture 5: Polynomial Hierarchy Instructor: Rafael Pass

Source URL: www.cs.cornell.edu

• Computational complexity theory
• Complexity classes
• Theory of computation
• Polynomial hierarchy
• P versus NP problem
• IP
• True quantified Boolean formula
• NP
• PP
• Oracle machine
• PSPACE-complete
• Polynomial-time reduction

KUIS{95{0009 Unateness, Symmetry and Self-Duality of Boolean Functions Satisfying the Propagation Criterion HIROSE Shouichi

Source URL: fuee.u-fukui.ac.jp