George S. Lueker, Nimrod Megiddo, Vijaya Ramachandran  Home/Search
Context Related
| stanford.edu/%7Emegiddo/...twlueket.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: stanford.edu/~megiddo/bio (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The parallel time complexity of the linear programming problem with at most twovariables per inequality is discussed. Let m denote the number of variables and the number of inequalities, respectively,ina linear programming problem. We assume all inequalities are weak. We describe an O((log m+log n)-time parallel algorithm for deciding feasibility, under the concurrent-read-exclusive-write PRAM model. It requires mn O(logn) processors in the worst case, though we do not know... (Update)
Context of citations to this paper: More
...per inequality (TVPI) It is probably the case that the MDP(2) problem is in NC, meaning that it can be eciently solved in parallel. In [81], the same open question is 139 raised about the TVPI problem. Linear optimization over TVPI is P complete [81] Deterministic MDP...
Cited by: More
Decidability of Type-checking in the Calculus of Algebraic.. - Blanqui (2005) (Correct)
Parallel Algorithms for the All-Sources Generalized Shortest.. - Oldham, Pratt (1999) (Correct)
Maximizing Concave Functions in Fixed Dimension - Cohen, Megiddo (1993) (Correct)
Similar documents (at the sentence level):
34.9%: Linear Programming with Two Variables per Inequality.. - Lueker, Megiddo.. (1990) (Correct)
Active bibliography (related documents): More All
0.0: A Compendium of Problems Complete for P - Greenlaw, Hoover, Ruzzo (1991) (Correct)
0.0: General Purpose Parallel Computing - McColl (1993) (Correct)
0.0: Evaluating Parallel Algorithms: Theoretical and Practical Aspects - Natvig (1996) (Correct)
Similar documents based on text: More All
0.4: Tight Bounds and 2-Approximation Algorithms for.. - Hochbaum, Megiddo.. (1992) (Correct)
0.2: An Efficient Parallel Algorithm for the General Planar.. - Ramachandran, Yang (1994) (Correct)
0.2: Workshop on Parallel Algorithms: From Solving Combinatorial.. - Flanagan, al. (1993) (Correct)
Related documents from co-citation: More All
6: Improved Algorithms for Linear Inequalities with Two Variables per Inequality (context) - Cohen, Megiddo - 1991
4: Two easy theories whose combination is hard - Pratt - 1977
4: Simple and fast algorithms for linear and integer programs with two variables pe.. (context) - Hochbaum, Naor - 1994
BibTeX entry: (Update)
G. S. Lueker, N. Megiddo, and V. Ramachandran. Linear programming with two variables per inequality in poly log time. SIAM J. Comput., 19(6):1000--1010, 1990. http://citeseer.ist.psu.edu/article/lueker90linear.html More
@inproceedings{ lueker86linear,
author = "G. S. Lueker and N. Megiddo and V. Ramachandran",
title = "Linear programming with two variables per inequality in poly-log time",
pages = "196--205",
year = "1986",
url = "citeseer.ist.psu.edu/article/lueker90linear.html" }
Citations (may not include all citations):303 Princeton University Press (context) - Ford, Fulkerson et al.
218 Parallelism in random access machines (context) - Fortune, Wyllie
174 The parallel evaluation of general arithmetic expressions (context) - Brent
168 A taxonomy of problems with fast parallel algorithms (context) - Cook
58 On relating time and space to size and depth (context) - Borodin
25 Routing, merging, and sorting on parallel models of computat.. (context) - Borodin, Hopcroft
19 Linear programming is log space hard for P (context) - Dobkin, Lipton et al.
18 A polynomial time algorithm for solving systems of linear in.. (context) - Aspvall, Shiloach
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://theory.stanford.edu/~megiddo/bio.html): More
Efficient Computation of Equilibria for Extensive.. - Koller, Megiddo, von.. (1995) (Correct)
A Note on Total Functions, Existence Theorems, and.. - Megiddo, Papadimitriou (1989) (Correct)
Tight Bounds and 2-Approximation Algorithms for.. - Hochbaum, Megiddo.. (1992) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC