Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The combinatorial and topological complexity of a single cell

From MaRDI portal
Publication:1864127
Jump to:navigation, search

DOI10.1007/s00454-002-2799-zzbMath1017.68056OpenAlexW3159952184MaRDI QIDQ1864127

Saugata Basu

Publication date: 17 March 2003

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-002-2799-z


zbMATH Keywords

computational geometrycombinatorial complexity


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)


Related Items (2)

Computing the Betti numbers of arrangements via spectral sequences ⋮ Multi-degree bounds on the Betti numbers of real varieties and semi-algebraic sets and applications






This page was built for publication: The combinatorial and topological complexity of a single cell

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1864127&oldid=14251675"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 11:30.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki