A new lower bound technique and its application: tight lower bound for a polygon triangulation problem

Authors:
Prakash Ramanan
Affiliations:
Department of Computer Science, University of California, Santa Barbara, CA
Venue:
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Year:
1991

Citing 3
Cited 0

Computation of matrix chain products. Part II

SIAM Journal on Computing
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Lower bounds for algebraic computation trees

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract