<--- Back to Details
First PageDocument Content
Theoretical computer science / Mathematical logic / Mathematics / Logic in computer science / NP-complete problems / Boolean algebra / Electronic design automation / Algebraic logic / Tseytin transformation / Boolean satisfiability problem / Conjunctive normal form / Canonical normal form
Date: 2015-02-02 08:44:10
Theoretical computer science
Mathematical logic
Mathematics
Logic in computer science
NP-complete problems
Boolean algebra
Electronic design automation
Algebraic logic
Tseytin transformation
Boolean satisfiability problem
Conjunctive normal form
Canonical normal form

Microsoft Word - IBSdoc

Add to Reading List

Source URL: foibg.com

Download Document from Source Website

File Size: 140,07 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