A pseudo-algorithmic separation of lines from pseudo-lines
type: Item
instance of: scholarly article
title: A pseudo-algorithmic separation of lines from pseudo-lines
zbMATH Open document ID: 1004.68603
DOI: 10.1016/0020-0190(94)00201-9
author: William Steiger
author: Ileana Streinu
published in: Information Processing Letters
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 985884
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: computational complexity
zbMATH Keywords: computational geometry
MaRDI profile type: Publication
full work available at URL: 0020-0190(94)00201-9
OpenAlex ID: W1988985328
cites work: An Optimal-Time Algorithm for Slope Selection
cites work: Q5187294
cites work: Q3772828
cites work: How good is the information theory bound in sorting?
cites work: Multidimensional Sorting
cites work: Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)
cites work: Q3138746
cites work: Sorting X + Y
cites work: Lower bounds on the length of monotone paths in arrangements
cites work: An upper bound on the number of planar \(K\)-sets
cites work: On the number of reduced decompositions of elements of Coxeter groups
description: scientific article; zbMATH DE number 985884