Boolean Constraint Propagation (BCP) for SAT

Loading...
En provenance du cours de Université de l'Illinois à Urbana-Champaign
VLSI CAD Part I: Logic
48 notes
Université de l'Illinois à Urbana-Champaign
48 notes
À partir de la leçon
Boolean Representation via BDDs and SAT
Week 2 introduces two powerful and important representation techniques that allow us to do SERIOUS computational Boolean algebra, on industrial-scale designs.

Rencontrer les enseignants

  • Rob A. Rutenbar
    Rob A. Rutenbar
    Adjunct Professor
    Department of Computer Science