论文信息 - The Parallel Complexity of Positive Linear Programming

The Parallel Complexity of Positive Linear Programming

In this paper we study the parallel complexity of Positive Linear Programming (PLP), i.e. the special case of Linear Programming in packing/covering form where the input constraint matrix and constraint vector consist entirely of positive entries. We show that the problem of exactly solving PLP is P-complete.

Fatos Xhafa | Luca Trevisan | F. Xhafa | L. Trevisan

[1] Maria J. Serna,et al. Approximating Linear Programming is Log-Space Complete for P , 1991, Inf. Process. Lett..

[2] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[3] Noam Nisan,et al. A parallel approximation algorithm for positive linear programming , 1993, STOC.

[4] R. Ladner. The circuit value problem is log space complete for P , 1975, SIGA.

[5] L. G. H. Cijan. A polynomial algorithm in linear programming , 1979 .

[6] Nimrod Megiddo,et al. A Note on Approximate Linear Programming , 1992, Inf. Process. Lett..

[7] Edith Cohen,et al. Approximate max flow on small depth networks , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[8] Richard J. Lipton,et al. Linear Programming is Log-Space Hard for P , 1979, Inf. Process. Lett..

[9] László Lovász,et al. On the ratio of optimal integral and fractional covers , 1975, Discret. Math..

[10] H. James Hoover,et al. Limits to Parallel Computation: P-Completeness Theory , 1995 .

[11] José L. Balcázar,et al. Structural Complexity I , 1995, Texts in Theoretical Computer Science An EATCS Series.

[12] Luca Trevisan,et al. Positive Linear Programming, Parallel Approximation and PCP's , 1996, ESA.