First Page | Document Content | |
---|---|---|
Date: 2006-02-09 03:56:19Theoretical computer science Computational complexity theory Mathematics Logic in computer science NP-complete problems Boolean algebra Boolean satisfiability problem Electronic design automation Symposium on Discrete Algorithms Approximation algorithm Random walk 2-satisfiability | Curriculum Vitae: Alexis C. Kaporis Contact information Address : Phone:Add to Reading ListSource URL: students.ceid.upatras.grDownload Document from Source WebsiteFile Size: 139,44 KBShare Document on Facebook |
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 LisbonDocID: 1rsZm - View Document | |
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 MartinDocID: 1rd10 - View Document | |
Microsoft PowerPoint - perspCompatibility Mode]DocID: 1r0cq - View Document |