<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2012-12-12 06:04:13NP-complete problems Combinatorial optimization Graph coloring Probabilistic complexity theory Algorithms Semidefinite programming Randomized algorithm Approximation algorithm Randomized rounding Theoretical computer science Mathematics Applied mathematics |
Add to Reading List |
Approximation Algorithms (ADM III) | A Family of Provably Correct Algorithms for Exact Triangle Coun;ng Ma=hew Lee, Tze Meng Low Correctness 2017DocID: 1xVUG - View Document |
| Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of viewDocID: 1xVR3 - View Document |
| Formal Correctness of Comparison Algorithms between Binary64 and Decimal64 Floating-point Numbers Arthur Blot ENS Lyon, France NSV, July 22-23, 2017DocID: 1xVvl - View Document |
| Theory and Techniques for Synthesizing a Family of Graph Algorithms Srinivas Nedunuri William R. CookDocID: 1xVkB - View Document |
| Stochastic Hillclimbing as a Baseline Method for Evaluating Genetic Algorithms Ari Juels Department of Computer ScienceDocID: 1xVfc - View Document |