Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
SODA
/
Paper
Finding minimal triangulations of convex 3-polytopes is NP-hard.
Alexander Below
,
Jess A. De Loera
,
Jrgen Richter-Gebert
Venue
A*
SODA
Year
2000
Proceedings
SODA
DBLP record
conf/soda/BelowLR00 ↗
Browse the full
SODA paper archive
.