Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB) Tobias Achterberg [email protected] Conflict Analysis in Mixed Integer Programming.
Synthetic Biology at Davidson College Building Bacterial Computers.
Technion 1 (Yet another) decision procedure for Equality Logic Ofer Strichman and Orly Meir Technion.
SymChaff: A Structure-Aware Satisfiability Solver Ashish Sabharwal University of Washington, Seattle AAAI, July 2005.
CS 480 Lec 2 Sept 4 complete the introduction Chapter 3 (search)
A New Kind of Science
Spiral Galaxies Puzzles are NP-complete
A New Kind of Science - S. Wolfram
Stephen Wolfram - A New Kind of Science
1 How to prove that a problem is NPC. 2 Cook Cook showed the first NPC problem: SAT Cook received Turing Award in 1982.
CSC5160 Topics in Algorithms Tutorial 2 Introduction to NP-Complete Problems
NP-Complete Problems