A pseudo-algorithmic separation of lines from pseudo-lines (Q674001): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An Optimal-Time Algorithm for Slope Selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How good is the information theory bound in sorting? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional Sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138746 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting X + Y / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the length of monotone paths in arrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on the number of planar \(K\)-sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of reduced decompositions of elements of Coxeter groups / rank
 
Normal rank

Latest revision as of 10:30, 27 May 2024

scientific article
Language Label Description Also known as
English
A pseudo-algorithmic separation of lines from pseudo-lines
scientific article

    Statements

    A pseudo-algorithmic separation of lines from pseudo-lines (English)
    0 references
    0 references
    0 references
    28 February 1997
    0 references
    analysis of algorithms
    0 references
    computational complexity
    0 references
    computational geometry
    0 references

    Identifiers