 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 Website File Size: 139,44 KBShare Document on Facebook
|
