MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "The Complexity of Linear Programming." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

75 documents found, showing 1 through 10. Next 10 →

ATOM

Towards low-complexity linear-programming decoding
by Pascal O. Vontobel, Ralf Koetter — 2006 — In Proc. of the 4th Int. Symp. on Turbo Codes and Related Topics, Munich,Germany
…arXiv:cs.IT/0602088 v1 26 Feb 2006 Towards Low-Complexity Linear-Programming Decoding Pascal O…
Cited by 6 (0 self) – Add To MetaCart

Probabilistic Analysis of Two Complexity Measures for Linear Programming Problems
by M.J. Todd, Levent Tunçel, Yinyu Ye — 1998 — Math. Prog. A
…Probabilistic analysis of two complexity measures for linear programming problems # M. J. Todd…
Cited by 8 (3 self) – Add To MetaCart

Probabilistic Analysis of Two Complexity Measures for Linear Programming Problems
by Todd Levent Tun, M. J. Todd, Yinyu Ye — 1998
…Probabilistic analysis of two complexity measures for linear programming problems M. J. Todd y…
Add To MetaCart

\Lambda
by Celz Yinyu Yex — 1998
… Probabilistic analysis of two complexity measures for linear programming problems \Lambda M. J…
Add To MetaCart

Linear Programming with Two Variables per Inequality in Poly-Log Time
by George S. Lueker, Nimrod Megiddo, Vijaya Ramachandran — 1990 — SIAM J. Computing
… Megiddo z Vijaya Ramachandran x Abstract. The parallel time complexity of the linear programming problem…
Cited by 5 (3 self) – Add To MetaCart

Selecting Tile Shape for Minimal Execution Time
by Karin Hogstedt, Larry Carter, Jeanne Ferrante — 1999
… to demonstrate the equivalence in complexity of linear programming and determining the execution time of a tiling…
Cited by 15 (2 self) – Add To MetaCart

Linear programming -- randomization and abstract frameworks
by Bernd Gärtner, Emo Welzl — 1996 — In Proc. 13th annu. Symp. on Theoretical Aspects of Computer Science (STACS
…Linear Programming – Randomization and Abstract Frameworks ∗ Bernd Gärtner and Emo Welzl Institut…
Cited by 19 (9 self) – Add To MetaCart

Give-N-Take - A Balanced Code Placement Framework
by Reinhard von Hanxleden, Reinhard Hanxleden, Ken Kennedy, Ken Kennedy — 1994 — In Proceedings of the SIGPLAN '94 Conference on Programming Language Design and Implementation
… intervals, with a complexity linear in the program size in most cases. We have implemented GIVE…
Cited by 9 (0 self) – Add To MetaCart

Using Fast Matrix Multiplication to Find Basic Solutions
by Peter A. Beling, Nimrod Megiddo — 1993 — IBM Research Division
… to that used by Vaidya to find the best complexity bounds for linear programming, is based on reducing much…
Cited by 4 (1 self) – Add To MetaCart

Randomized Simplex Algorithms on Klee-Minty Cubes
by Bernd Gärtner, Martin Henk, Günter M. Ziegler — 1994 — Combinatorica
… leads to (nearly) quadratic lower bounds for the complexity of linear programming with random pivots…
Cited by 15 (6 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB