Searching for "A Subexponential Bound for Linear Programming." – sorted by Relevance.
-
A Subexponential Bound for Linear Programming
- appeared in Algorithmica 16 (1996) 498-516. A Subexponential Bound for Linear Programming y Ji r
- Cited by 129 (15 self) – Add To MetaCart
-
Computational Geometry Column 29
- . Sharir, and E. Welzl. A subexponential bound for linear programming. In Proc. 8th Annu. ACM Sympos
- Cited by 1 (0 self) – Add To MetaCart
-
[GM91] S. K. Ghosh and D. M. Mount. An output-sensitive algorithm for computing visibility graphs.
- . Sharir, and E. Welzl. A subexponential bound for linear programming. In Proc. 8th Annu. ACM Sympos
- Add To MetaCart
-
Bibliography
- . Welzl. A subexponential bound for linear programming. Algorithmica, 16:498--516, 1996. [MN95] K
- Add To MetaCart
-
Case-Based BDI Agents: an Effective Approach for Intelligent Search on the World Wide Web
- A Subexponential Bound for Linear Programming y Ji r' i Matou sek z Department of Applied
- Cited by 3 (0 self) – Add To MetaCart

