The fourth moment method

SIAM Journal on Computing

Volumn 26, Issue 4, 1997, Pages 1188-1207

  Berger, Bonnie ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Gayle Berlekamp switching game; Maximum acyclic subgraph; Removing randomness; Set discrepancy

Indexed keywords

ALGORITHMS; GRAPH THEORY; OPTIMIZATION; POLYNOMIALS; RANDOM PROCESSES;

EDGE DISCREPANCY; FOURTH MOMENT METHOD; GAYLE-BERLEKAMP SWITCHING GAME;

COMBINATORIAL MATHEMATICS;

EID: 0031210864     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539792240005     Document Type: Article

References (27)

1. N. ALON, L. BABAI, AND A. ITAI, A fast and simple randomized parallel algorithm for the maximal independent set problem, J. Algorithms, 7 (1986), pp. 567-583.
2. B. BERGER, Data structures for removing randomness, Technical Report MIT/LCS/TR-436, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 1988.
3. B. BERGER, Using randomness to design efficient deterministic algorithms, Ph.D. thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 1990.
4. B. BERGER, The fourth moment method, in Proc. 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 1991, pp. 373-383.
5. c n)-wise independence in NC, J. Assoc. Comput. Mach., 38 (1991), pp. 1026-1046.
6. B. BERGER AND P. SHOR, Approximation algorithms for the maximum acyclic subgraph problem, in Proc. 1st Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 1990, pp. 236-243.
7. T. BROWN AND J. SPENCER, Minimization of ± matrices under line shifts, Colloq. Math. (Poland), 23 (1971), pp. 165-171.
8. W. FERNANDEZ DE LA VEGA, On the maximum cardinality of a consistent set of arcs in a random tournament, J. Combin. Theory B, 35 (1983), pp. 328-332.
9. L. DEVROYE AND L. GJÖRFI, Nonparametric Density Estimation: The L1 View, John Wiley, New York, 1985.
10. P. ERDÖS AND J. SPENCER, Imbalances in k-colorations, Networks, 1 (1972), pp. 379-385.
11. R. GREENLAW, The parallel complexity of approximation algorithms for the acyclic subgraph problem, Technical Report 90-61, Department of Computer Science, University of New Hampshire, Durham, NH, 1990.
12. G. HARDY, J. E. LITTLEWOOD, AND G. PÒLYA, Inequalities, Cambridge Mathematical Library, Cambridge, MA, 1988.
13. A. JOFFE, On a set of almost deterministic k-independent random variables, Ann. Probability, 2 (1974), pp. 161-162.
14. R. M. KARP AND A. WIGDERSON, A fast parallel algorithm for the maximal independent set problem, J. Assoc. Comput. Mach., 32 (1985), pp. 762-773.
15. R. H. LATHROP, R. J. HALL, AND R. S. KIRK, Functional abstraction from structure in VLSI simulation models, in Proc. 24th IEEE-ACM Design Automation Conference, IEEE, Piscataway, NJ, 1987, pp. 822-828.
16. J. LEUNG, private communication, 1989.
17. M. LUBY, A simple parallel algorithm for the maximal independent set problem, SIAM J. Comput., 15 (1986), pp. 1036-1053.
18. M. LUBY, Removing randomness in parallel computation without a processor penalty, J. Comput. System Sci., 47 (1993), pp. 250-286.
19. R. MOTWANI, J. NAOR, AND M. NAOR, The probabilistic method yields deterministic parallel algorithms, J. Comput. System Sci., 49 (1994), pp. 478-516.
20. S. POLJAK, V. RÖDL, AND J. SPENCER, Tournament ranking with expected profit in polynomial time, SIAM J. Discrete Math., 1 (1988), pp. 372-376.
21. P. RAGHAVAN, Probabilistic construction of deterministic algorithms: Approximating packing integer programs, J. Comput. System Sci., 37 (1988), pp. 130-143.
22. V. RAMACHANDRAN, Finding a minimum feedback arc set in reducible flow graphs, J. Algorithms, 9 (1988), pp. 299-313.
23. I. R. SAVAGE, Probability inequalities of the Tchebycheff type, J. Res. Nat. Bureau Standards, 65B (1972), pp. 211-222.
24. M. H. SHIRLEY, Generating circuit tests by exploiting designed behavior, Technical Report MIT/AI/TR-1099, Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, 1988.
25. J. SPENCER, Optimal ranking of tournaments, Networks, 1 (1972), pp. 135-138.
26. J. SPENCER, Ten Lectures on the Probabilistic Method, SIAM, Philadelphia, PA, 1987.
27. P. TETALI, Derandomization of discrepancy results, manuscript, 1991.