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 |
Curriculum Vitae: Alexis C. Kaporis Contact information Address : Phone:DocID: 1roWY - View Document | |
Vita of Kirk Pruhs Department of Computer Science University of Pittsburgh Pittsburgh, PA8844DocID: 1qC5S - View Document | |
˘ TUGKAN BATU Department of Mathematics London School of EconomicsDocID: 1qm8N - View Document | |
Literaturverzeichnis 1. Alizadeh, F): A sublinear-time randomized parallel algorithm for the maximum clique problem in perfect graphs. Proceedings of the second ACMSIAM Symposium on Discrete Algorithms 2. AlizadeDocID: 1qhO6 - View Document | |
JOAN FEIGENBAUM MAILING ADDRESS STREET ADDRESSDocID: 1pA8Z - View Document |