Article

Algorithmic derandomization via complexity theory

Author:

D. SivakumarAuthors Info & Claims

STOC '02: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing

Pages 619 - 626

https://doi.org/10.1145/509907.509996

Published: 19 May 2002 Publication History

Abstract

We point out how the methods of Nisan [31, 32], originally developed for derandomizing space-bounded computations, may be applied to obtain polynomial-time and NC derandomizations of several probabilistic algorithms. Our list includes the randomized rounding steps of linear and semi-definite programming relaxations of optimization problems, parallel derandomization of discrepancy-type problems, and the Johnson--Lindenstrauss lemma, to name a few.A fascinating aspect of this style of derandomization is the fact that we often carry out the derandomizations directly from the statements about the correctness of probabilistic algorithms, rather than carefully mimicking their proofs.

References

[1]

D. Achlioptas. Database friendly random projections. In Proc. Principles of Database Systems (PODS), pages 274--281, 2001.

Digital Library

[2]

N. Alon, L. Babai, and A. Itai. A fast and simple randomized parallel algorithm for the maximal independent set problem. Journal of Algorithms, 7:567--583, 1986.

Digital Library

[3]

N. Alon and J. Spencer. The Probabilistic Method. Wiley, 1992. With an appendix by P. Erdós.

[4]

R. Armoni, A. Ta-Shma, A. Wigderson, and S. Zhou. SL &sube; L4/3. In Proc. 29th Annual ACM Symposium on the Theory of Computing, pages 230--239, 1997. Journal version in Journal of the ACM, 47(2):294--311, 2000.

Digital Library

[5]

B. Berger and J. Rompel. Simulating (logcn)-wise independence in NC. In Proc. 30th Annual IEEE Symposium on Foundations of Computer Science, pages 2--7, 1989.

Digital Library

[6]

B. Chor and O. Goldreich. RSA/Rabin least significant bits are 1/2 + 1/poly(log N) secure. In CRYPTO: Proceedings of Crypto, pages 303--313, 1984.

Digital Library

[7]

S. Dasgupta and A. Gupta. An elementary proof of the Johnson--Lindenstrauss lemma. Technical Report 99-006, University of California, Berkeley, 1999.

[8]

L. Engebretsen, P. Indyk, and R. O'Donnell. Derandomized dimensionality reduction with applications. In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 2002.

Digital Library

[9]

P. Frankl and H. Maehara. The Johnson--Lindenstrauss lemma and the sphericity of some graphs. Journal of Combinatorial Theory Series B, 44:355--362, 1988.

Digital Library

[10]

M. Goemans and D. Williamson. .878-approximation algorithms for MAX CUT and MAX 2SAT. In Proc. 26th Annual ACM Symposium on the Theory of Computing, pages 422--431, 1994. Journal version in Journal of the ACM, 42(6):1115--1145, 1995.

Digital Library

[11]

M. X. Goemans and D. P. Williamson. A new ¾-approximation algorithm for MAX SAT. In Proc. Integer Programming and Combinatorial Optimization (IPCO), pages 313--322, 1993. Journal version in SIAM Journal on Discrete (MATH)ematics, 7(4):656--666, 1994.

Digital Library

[12]

P. Indyk. Stable distributions, pseudorandom generators, embeddings and data stream computation. In Proc. 41st Annual IEEE Symposium on Foundations of Computer Science, pages 189--197, 2000.

Digital Library

[13]

P. Indyk. Algorithmic applications of geometric embeddings. In Proc. 42nd Annual IEEE Symposium on Foundations of Computer Science, 2001.

Digital Library

[14]

P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In Proc. 30th Annual ACM Symposium on the Theory of Computing, pages 604--613, 1998.

Digital Library

[15]

W. Johnson and J. Lindenstrauss. Extensions of Lipschitz mappings into a Hilbert space. In Conference in modern analysis and probability, pages 189--206. American (MATH)ematical Society, 1984.

[16]

D. Karger and D. Koller. (De)randomized construction of small sample spaces in NC. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pages 252--263, 1994.

Digital Library

[17]

D. Karger, R. Motwani, and M. Sudan. Approximate graph coloring by semidefinite programming. In Proc. 35th Annual IEEE Symposium on Foundations of Computer Science, pages 2--13, 1994. Journal version in Journal of the ACM, 45(2):246--265, 1998.

Digital Library

[18]

D. R. Karger. Global min-cuts in RNC, and other ramifications of a simple min-cut algorithm. In Proc. 4th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 21--30, 1993. Journal version in Journal of the ACM, 43(4):601--640, 1996.

Digital Library

[19]

R. Karp and A. Wigderson. A fast parallel algorithm for the maximal independent set problem. In Proc. 15th Annual ACM Symposium on the Theory of Computing, pages 266--272, 1984. Journal version in Journal of the ACM, 32(4): 762-773 (1985).

Digital Library

[20]

D. Knuth. The Art of Computer Programming: volume 2, Seminumerical Algorithms. Addison--Wesley, 3rd edition, 1997.

Digital Library

[21]

D. Koller and N. Megiddo. Constructing small sample spaces satisfying given constraints. In Proc. 25th Annual ACM Symposium on the Theory of Computing, pages 268--277, 1993. Journal version in SIAM Journal on Discrete (MATH)ematics, 7(2): 260--274 (1994).

Digital Library

[22]

N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. In Proc. 35th Annual IEEE Symposium on Foundations of Computer Science, pages 577--591, 1994. Journal version in Combinatorica, 15(2):215--245, 1995.

Digital Library

[23]

M. Luby. A simple parallel algorithm for the maximal independent set problem. In Proc. 17th Annual ACM Symposium on the Theory of Computing, pages 1--10, 1985. Journal version in SIAM Journal on Computing, 15(4):1036--1053, 1986.

Digital Library

[24]

S. Mahajan and H. Ramesh. Derandomizing semidefinite programming based approximation algorithms. In Proc. 36th Annual IEEE Symposium on Foundations of Computer Science, pages 162--169, 1995. Journal version in SIAM Journal on Computing, 28(5):1641--1663, 1999.

Digital Library

[25]

S. Mahajan, E. Ramos, and K. Subrahmanyam. Solving some discrepancy problems in NC. In Proc. 17th FST & TCS, Lecture Notes in Computer Science, pages 22--36. Springer-Verlag, 1997. Journal version in Algorithmica, 29(3), 371--395, 2001.

Digital Library

[26]

R. Motwani, J. Naor, and M. Naor. The probabilistic method yields deterministic parallel algorithms. In Proc. 30th Annual IEEE Symposium on Foundations of Computer Science, pages 8--13, 1989. Journal version in Journal of Computer and System Sciences, 49(3):478--516, 1994.

Digital Library

[27]

R. Motwani, J. Naor, and P. Raghavan. Randomization in approximation algorithms. In D. Hochbaum, editor, Approximation Algorithms. PWS Publishers, 1995.

[28]

R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.

Digital Library

[29]

K. Mulmuley, U. Vazirani, and V. Vazirani. Matching is as easy as matrix inversion. Combinatorica, 7:105--113, 1987.

Digital Library

[30]

J. Naor and M. Naor. Small-bias probability spaces: efficient constructions and applications. In Proc. 22nd Annual ACM Symposium on the Theory of Computing, pages 213--223, 1990. Journal version in SIAM Journal on Computing, 22(4):838--856, 1993.

Digital Library

[31]

N. Nisan. Pseudorandom generators for space-bounded computation. In Proc. 22nd Annual ACM Symposium on the Theory of Computing, pages 204--212, 1990. Journal version in Combinatorica, 12:449--461, 1992.

Digital Library

[32]

N. Nisan. RL &sube; SC. In Proc. 24th Annual ACM Symposium on the Theory of Computing, pages 619--623, 1992. Journal version in Computational Complexity, 4:1--11, 1994.

Digital Library

[33]

N. Nisan, E. Szemerédi, and A. Wigderson. Undirected connectivity in O(log1.5 n) space. In Proc. 33rd Annual IEEE Symposium on Foundations of Computer Science, pages 24--29, 1992.

Digital Library

[34]

N. Nisan and A. Wigderson. Hardness vs. randomness. In Proc. 29th Annual IEEE Symposium on Foundations of Computer Science, pages 2--11, 1988. Journal version in Journal of Computer and System Sciences, 49(2):149--167, 1994.

Digital Library

[35]

P. Raghavan. Probabilistic construction of deterministic algorithms: Approximating packing integer programs. Journal of Computer and System Sciences, 37(2):130--143, 1988.

Digital Library

[36]

S. Rajagopalan and V. Vazirani. Primal-dual RNC approximation algorithms for set cover and covering integer programs. SIAM Journal on Computing, 28(2):525--540, 1998.

Digital Library

[37]

M. Saks and S. Zhou. RSPACE(S) &sube; DSPACE(S3/2). In Proc. 36th Annual IEEE Symposium on Foundations of Computer Science, pages 344--353, 1995. Journal version in Journal of Computer and System Sciences, 58(2):376--403, 1999.

Digital Library

[38]

L. Schulman. Sample spaces uniform on neighborhoods. In Proc. 24th Annual ACM Symposium on the Theory of Computing, pages 17--25, 1992.

Digital Library

[39]

M. Sipser. A complexity-theoretic approach to randomness. In Proc. 15th Annual ACM Symposium on the Theory of Computing, pages 330--335, 1983.

Digital Library

[40]

A. Srinivasan. New approaches to covering and packing problems. In Proc. 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 567--576, 2001.

Digital Library

[41]

L. Stockmeyer. The complexity of approximate counting. In Proc. 15th Annual ACM Symposium on the Theory of Computing, pages 118--126, 1983.

Digital Library

[42]

A. Wigderson. The amazing power of pairwise independence. In Proc. 26th Annual ACM Symposium on the Theory of Computing, pages 645--647, 1994.

Digital Library

Cited By

Hoza WPyne EVadhan S(2024)Limitations of the Impagliazzo–Nisan–Wigderson Pseudorandom Generator Against Permutation Branching ProgramsAlgorithmica10.1007/s00453-024-01251-2Online publication date: 29-Jul-2024
https://doi.org/10.1007/s00453-024-01251-2
Harris D(2023)Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallelRandom Structures & Algorithms10.1002/rsa.2115263:3(716-752)Online publication date: 15-Apr-2023
https://doi.org/10.1002/rsa.21152
Hassantabar SWang ZJha N(2022)SCANN: Synthesis of Compact and Accurate Neural NetworksIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2021.311647041:9(3012-3025)Online publication date: Sep-2022
https://doi.org/10.1109/TCAD.2021.3116470
Show More Cited By

Index Terms

Algorithmic derandomization via complexity theory

Recommendations

Algorithmic Derandomization via Complexity Theory
CCC '02: Proceedings of the 17th IEEE Annual Conference on Computational Complexity

We point out how the methods of Nisan (1990, 1992), originally developed for derandomizing space-bounded computations, may be applied to obtain polynomial-time and NC derandomizations of several probabilistic algorithms. Our list includes the randomized ...
The complexity of hardness amplification and derandomization
Holographic Proofs and Derandomization

We derive a stronger consequence of $\mathsf{EXP}$ (deterministic exponential time) having polynomial-size circuits than was known previously, namely that for each language $L \in \mathsf{P}$ (polynomial time), and for each efficiently decidable error-...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

STOC '02: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing

May 2002

840 pages

ISBN:1581134959

DOI:10.1145/509907

Conference Chair:
John Reif
Duke University

Copyright © 2002 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 May 2002

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC02

Sponsor:

SIGACT

STOC02: Symposium on the Theory of Computing

May 19 - 21, 2002

Quebec, Montreal, Canada

Acceptance Rates

STOC '02 Paper Acceptance Rate 91 of 287 submissions, 32%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

39
Total Citations
View Citations
212
Total Downloads

Downloads (Last 12 months)53
Downloads (Last 6 weeks)3

Reflects downloads up to 12 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Hoza WPyne EVadhan S(2024)Limitations of the Impagliazzo–Nisan–Wigderson Pseudorandom Generator Against Permutation Branching ProgramsAlgorithmica10.1007/s00453-024-01251-2Online publication date: 29-Jul-2024
https://doi.org/10.1007/s00453-024-01251-2
Harris D(2023)Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallelRandom Structures & Algorithms10.1002/rsa.2115263:3(716-752)Online publication date: 15-Apr-2023
https://doi.org/10.1002/rsa.21152
Hassantabar SWang ZJha N(2022)SCANN: Synthesis of Compact and Accurate Neural NetworksIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2021.311647041:9(3012-3025)Online publication date: Sep-2022
https://doi.org/10.1109/TCAD.2021.3116470
Pyne EVadhan S(2021)Limitations of the Impagliazzo–Nisan–Wigderson Pseudorandom Generator Against Permutation Branching ProgramsComputing and Combinatorics10.1007/978-3-030-89543-3_1(3-12)Online publication date: 20-Oct-2021
https://doi.org/10.1007/978-3-030-89543-3_1
Harris D(2019)Derandomized Concentration Bounds for Polynomials, and Hypergraph Maximal Independent SetACM Transactions on Algorithms10.1145/332617115:3(1-29)Online publication date: 16-Jul-2019
https://dl.acm.org/doi/10.1145/3326171
Harris D(2019)Deterministic Parallel Algorithms for Bilinear Objective FunctionsAlgorithmica10.1007/s00453-018-0471-081:3(1288-1318)Online publication date: 1-Mar-2019
https://dl.acm.org/doi/10.1007/s00453-018-0471-0
Dadush DGuzmán COlver NCzumaj A(2018)Fast, deterministic and sparse dimensionality reductionProceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3174304.3175357(1330-1344)Online publication date: 7-Jan-2018
https://dl.acm.org/doi/10.5555/3174304.3175357
Harris D(2018)Deterministic Parallel Algorithms for Fooling Polylogarithmic Juntas and the Lovász Local LemmaACM Transactions on Algorithms10.1145/323065114:4(1-24)Online publication date: 28-Aug-2018
https://dl.acm.org/doi/10.1145/3230651
Chattopadhyay EHatami PReingold OTal ADiakonikolas IKempe DHenzinger M(2018)Improved pseudorandomness for unordered branching programs through local monotonicityProceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3188745.3188800(363-375)Online publication date: 20-Jun-2018
https://dl.acm.org/doi/10.1145/3188745.3188800
Harris DKlein P(2017)Deterministic parallel algorithms for fooling polylogarithmic juntas and the lovász local lemmaProceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3039686.3039763(1188-1203)Online publication date: 16-Jan-2017
https://dl.acm.org/doi/10.5555/3039686.3039763
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents