The complexity of linear programming (Q5904560): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(80)90031-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1967036113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Finding All Vertices of Convex Polyhedral Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating All the Faces of a Polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Convex Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional Searching Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming is log-space hard for P / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4403756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On The Number of Faces of a Convex Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for determining the convex hull of a finite planar set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5547252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polytopes, graphs, and complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the identification of the convex hull of a finite set of points in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: The densest hemisphere problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete problems for deterministic polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of linear programming problems requiring a large number of iterations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heights of convex polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Vertices of a Convex Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Inequalities and Related Systems. (AM-38) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Polynomial Time Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4066843 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Extreme Rays of a Pointed Convex Polyhedral Cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient search for rationals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex hulls of finite sets of points in two and three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the intersection of n half-spaces in time O(n log n) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5603731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for frames and lineality spaces of cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bad network problem for the simplex method and other minimum cost flow algorithms / rank
 
Normal rank

Latest revision as of 09:45, 13 June 2024

scientific article; zbMATH DE number 3698715
Language Label Description Also known as
English
The complexity of linear programming
scientific article; zbMATH DE number 3698715

    Statements

    The complexity of linear programming (English)
    0 references
    0 references
    0 references
    1980
    0 references
    LP-complete problems
    0 references
    computability equivalent problems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers