<--- Back to Details
First PageDocument Content
Computer programming / Theoretical computer science / Software engineering / Logic in computer science / Computational complexity theory / Boolean algebra / NP-complete problems / Formal methods / Boolean satisfiability problem / Conditional / Reduction / Algorithm
Date: 2010-09-11 18:41:20
Computer programming
Theoretical computer science
Software engineering
Logic in computer science
Computational complexity theory
Boolean algebra
NP-complete problems
Formal methods
Boolean satisfiability problem
Conditional
Reduction
Algorithm

The Straight-Line Automatic Programming Problem Rajeev Joshi, Greg Nelson, Yunhong Zhou HP Laboratories Palo Alto HPLNovember 20th , 2003* superoptimization,

Add to Reading List

Source URL: rjoshi.org

Download Document from Source Website

File Size: 94,91 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