Many-face complexity in incremental convex arrangements (Q1336754): 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/0020-0190(94)00098-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2075529348 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting facets and incidences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Decomposition of Polyhedra and Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial complexity bounds for arrangements of curves and spheres / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of many cells in arrangements of planes and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of K. Zarankiewicz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting hyperplane arrangements / rank
 
Normal rank

Latest revision as of 09:12, 23 May 2024

scientific article
Language Label Description Also known as
English
Many-face complexity in incremental convex arrangements
scientific article

    Statements

    Identifiers