One line and n points (Q4446873): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q54310249, #quickstatements; #temporary_batch_1707149277123
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Bernd Gärtner / rank
Normal rank
 
Property / author
 
Property / author: Ermo Welzl / rank
Normal rank
 
Property / author
 
Property / author: József Solymosi / rank
Normal rank
 
Property / author
 
Property / author: Bernd Gärtner / rank
 
Normal rank
Property / author
 
Property / author: Ermo Welzl / rank
 
Normal rank
Property / author
 
Property / author: József Solymosi / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/rsa.10099 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2079716694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The worst-case running time of the random simplex algorithm is exponential in the height / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized simplex algorithms on Klee-Minty cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming, the simplex algorithm and simple polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3914762 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entering and leaving \(j\)-facets / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:42, 6 June 2024

scientific article; zbMATH DE number 2037530
Language Label Description Also known as
English
One line and n points
scientific article; zbMATH DE number 2037530

    Statements

    One line and n points (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    3 February 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    simplex algorithm
    0 references
    linear programming
    0 references
    random-edge pivot rule
    0 references
    randomization
    0 references
    0 references
    0 references