<--- Back to Details
First PageDocument Content
Association for Computing Machinery / ACM SIGACT / Symposium on Discrete Algorithms / Fellows of the American Association for the Advancement of Science / Annie Antn
Date: 2016-08-02 15:08:03
Association for Computing Machinery
ACM SIGACT
Symposium on Discrete Algorithms
Fellows of the American Association for the Advancement of Science
Annie Antn

JOAN FEIGENBAUM MAILING ADDRESS STREET ADDRESS

Add to Reading List

Source URL: www.cs.yale.edu

Download Document from Source Website

File Size: 96,00 KB

Share Document on Facebook

Similar Documents

Theoretical 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:

DocID: 1roWY - View Document

Theoretical computer science / Computer science / Science / Academia / ACM SIGACT / Symposium on Discrete Algorithms / ACM Transactions on Algorithms / Algorithmica / Symposium on Parallelism in Algorithms and Architectures / European Symposium on Algorithms / International Colloquium on Automata /  Languages and Programming / Computational geometry

Vita of Kirk Pruhs Department of Computer Science University of Pittsburgh Pittsburgh, PA8844

DocID: 1qC5S - View Document

Theoretical computer science / Science and technology / Computer science / Ronitt Rubinfeld / Symposium on Discrete Algorithms / Computational learning theory / Symposium on Theory of Computing / Algorithm / ACM Transactions on Algorithms / ACM SIGACT

˘ TUGKAN BATU Department of Mathematics London School of Economics

DocID: 1qm8N - View Document

Mathematical optimization / Numerical analysis / Mathematical analysis / Linear programming / Convex optimization / Interior point method / Quadratic programming / Global optimization / Robert J. Vanderbei / Quasi-Newton method / Nonlinear programming / Linear matrix inequality

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. Alizade

DocID: 1qhO6 - View Document

Association for Computing Machinery / ACM SIGACT / Symposium on Discrete Algorithms / Fellows of the American Association for the Advancement of Science / Annie Antn

JOAN FEIGENBAUM MAILING ADDRESS STREET ADDRESS

DocID: 1pA8Z - View Document