A New Lower Bound Technique and Its Application: Tight Lower Bound for a Polygon Triangulation Problem

DOI10.1137/S0097539790190077zbMath0809.68073OpenAlexW2028574474MaRDI QIDQ4305360

Prakash V. Ramanan

Publication date: 13 September 1994

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539790190077

zbMATH Keywords

time-complexitypolygon triangulationmatrix chain productbounded degree algebraic decision trees

Mathematics Subject Classification ID

Related Items (2)

Lower bounds for the matrix chain ordering problem ⋮ Revisiting “Computation of Matrix Chain Products

This page was built for publication: A New Lower Bound Technique and Its Application: Tight Lower Bound for a Polygon Triangulation Problem