Algorithmic derandomization via complexity theory
- 19 May 2002
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 619-626
- https://doi.org/10.1145/509907.509996
Abstract
No abstract availableThis publication has 28 references indexed in Scilit:
- Derandomizing Approximation Algorithms Based on Semidefinite ProgrammingSIAM Journal on Computing, 1999
- Approximate graph coloring by semidefinite programmingJournal of the ACM, 1998
- Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer ProgramsSIAM Journal on Computing, 1998
- The probabilistic method yields deterministic parallel algorithmsJournal of Computer and System Sciences, 1994
- New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability ProblemSIAM Journal on Discrete Mathematics, 1994
- Hardness vs randomnessJournal of Computer and System Sciences, 1994
- Probabilistic construction of deterministic algorithms: Approximating packing integer programsJournal of Computer and System Sciences, 1988
- Matching is as easy as matrix inversionCombinatorica, 1987
- A fast and simple randomized parallel algorithm for the maximal independent set problemJournal of Algorithms, 1986
- Extensions of Lipschitz mappings into a Hilbert spacePublished by American Mathematical Society (AMS) ,1984