<--- Back to Details
First PageDocument Content
Boolean algebra / Symmetry / Logic in computer science / NP-complete problems / Electronic design automation / Boolean satisfiability problem / True quantified Boolean formula / Conjunctive normal form / Symmetry in mathematics / Theoretical computer science / Mathematics / Applied mathematics
Date: 2014-01-02 11:31:27
Boolean algebra
Symmetry
Logic in computer science
NP-complete problems
Electronic design automation
Boolean satisfiability problem
True quantified Boolean formula
Conjunctive normal form
Symmetry in mathematics
Theoretical computer science
Mathematics
Applied mathematics

Symmetry in Gardens of Eden Christiaan Hartman Marijn J. H. Heule∗ Delft University of Technology

Add to Reading List

Source URL: www.cs.utexas.edu

Download Document from Source Website

File Size: 420,36 KB

Share Document on Facebook

Similar Documents

1  Overview • This talk is about: – The Boolean Satisfiability Problem (SAT) – The Constraint Satisfaction Problem (CSP)

1 Overview • This talk is about: – The Boolean Satisfiability Problem (SAT) – The Constraint Satisfaction Problem (CSP)

DocID: 1ukgD - View Document

On Solving Boolean Multilevel Optimization Problems∗ Josep Argelich INESC-ID Lisbon

On Solving Boolean Multilevel Optimization Problems∗ Josep Argelich INESC-ID Lisbon

DocID: 1rsZm - View Document

Curriculum Vitae: Alexis C. Kaporis  Contact information Address :  Phone:

Curriculum Vitae: Alexis C. Kaporis Contact information Address : Phone:

DocID: 1roWY - View Document

A tetrachotomy for positive first-order logic without equality Florent Madelaine Barnaby Martin

A tetrachotomy for positive first-order logic without equality Florent Madelaine Barnaby Martin

DocID: 1rd10 - View Document

Microsoft PowerPoint - perspCompatibility Mode]

Microsoft PowerPoint - perspCompatibility Mode]

DocID: 1r0cq - View Document