The complexity of linear programming is discussed in the "integer" and "real number" models of computation. Even though the integer model is widely used in theoretical computer science, the real number model is more useful for estimating an algorithm's running time in actual computation. Although...
摘要原文 The complexity of linear programming is discussed in the “integer” and “real number” models of computation. Even though the integer model is widely used in theoretical computer science, the real number model is more useful for estimating an algorithm's running time in actual computati...
BSS-modelWe consider the Blum–Shub–Smale model of computation over the reals. It was shown that the Linear Programming Feasibility problem (LP,LPyes) (i.e., given A∈Rm×n,b∈Rm, does there exist an x∈R+n s.t. A×x=b?) is reducible in polynomial time to (F2,F2zero,+) ...
The notions pertain to linear programming quite generally; the underlying vector spaces are not required to be finite-dimensional and, more importantly, the cones defining nonnegativity are not required to be polyhedral. Thus, for example, the notions are appropriate in the context of semi-definite...
Summary of results The linear programming feasibility problem over the reals can be stated as follows: given natural numbers m > n, a matrix H ∈ Rm×n and a vector h ∈ Rm decide whether there exists a vector x ∈ Rn such that H · x ≤ h. We analyze the complexity of this ...
Complexity of linear programming The complexity of linear programming is discussed in the "integer" and "real number" models of computation. Even though the integer model is widely used in... JF Traub,H Wo?Niakowski - 《Operations Research Letters》 被引量: 149发表: 1982年 Logic Programming ...
It could be said that the modern theory of computation began with Alan Turing in the 1930's. After a period of steady development,<###next line###> work in... WE Howden 被引量: 18发表: 1978年 Some lower bounds for the complexity of the linear programming feasibility problem over the...
A class of polynomial primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function,with parameters an... QB Yan,QW Guo - 《数学学报(英文版)》 被引量: 113发表: 2007年 The Homotopy Principle and Algorithms for Linear Programming primal-dualEu...
On the space complexity of linear programming with preprocessing. On the space complexity of linear program- ming with preprocessing. In Proceedings of the 7th Innovations in Theoretical Computer Science Conference, ITCS '... Y Tauman Kalai,R Raz,O Regev - ACM 被引量: 2发表: 2016年 Evaluating...
Linear programming in linear time when the dimension is fixed. Journal of the ACM (JACM), 31(1), pp.114-127. Seidel, R., 1991. Small-dimensional linear programming and convex hulls made easy. Discrete & Computational Geometry, 6(3), pp.423-434. About Seidel's LP Algorithm: Linear-...