A deterministic poly(log log N)-time N-processor algorithm for linear programming in fixed dimension

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129722, Issue , 1992, Pages 327-338

  Ajtai, Miklos ^a   Megiddo, Nimrod ^a,b  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; PARALLEL PROCESSING SYSTEMS; COMPUTATIONAL COMPLEXITY; LINEAR PROGRAMMING;

FIXED NUMBERS; LINEAR INEQUALITIES; LINEAR PROGRAMMING PROBLEM; LOGARITHMIC TIME; PARALLEL PROCESSOR; TIME BOUND;

LINEAR PROGRAMMING; ALGORITHMS;

DETERMINISTIC ALGORITHMS; FIXED DIMENSION; INEQUALITIES; PARALLEL COMPLEXITY;

EID: 0026963440     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/129712.129744     Document Type: Conference Paper

References (12)

1. M. Ajtai, J. Komlós, W. L. Steiger, and E. Sze-merédi, "Optimal parallel selection Las complexity O(loglogJV)," J. Comp. Sys. Sci. 38 (1989) 125-133.
2. N. Alon and N. Megiddo, "Parallel linear programming in fixed dimension almost surely in constant time," in: Proceedings of the 31st IEEE Symposium on Foundations of Computer Science (1990), IEEE Computer Society Press, Los Angeles, 1990, pp. 574-582.
3. K. L. Clarkson, "Linear programming in 0(n x 3) time," Information Processing Letters 22 (1986) 21-27.
4. X. Deng, "An optimal parallel algorithm for linear programming in the plane," Information Processing Letters 35 (1990) 213-217.
5. D. Dobkin, R. J. Lipton, and S. Reiss, "Linear programming is log space hard for P," Information Processing Letters 8 (1979) 96-97.
6. M. E. Dyer, "Linear time algorithms for two- and three-variable linear programs," SIAM J. Comput. 13 (1984) 31-45.
7. M. E. Dyer, "On a multidimensional search technique and its application to the Euclidean one-center problem," SIAM J. Comput. 15 (1986) 725-738.
8. A. Lubotzky, R. Phillips, and P. Sarnak, "Explicit expanders and the Ramanujan conjectures," Com-binatorica 8 (1988) 261-277.
9. N. Megiddo, "Linear-time algorithms for linear programming in R3 and related problems," SIAM J. Comput. 12 (1983) 759-776.
10. N. Megiddo, "Linear programming in linear time when the dimension is fixed," J. ACM 31 (1984) 114-127.
11. N. Megiddo, "Dynamic location problems," Annals of Operations Research 6 (1986) 313-319.
12. R. M. Tanner, "Explicit concentrators from generalized N-gons," SIAM J. Alg. Disc. Meth. 5 (1984) 287-293.