Back to Results
First PageMeta Content



Sharp Bounds on Davenport-Schinzel Sequences of Every Order SETH PETTIE, University of Michigan One of the longest-standing open problems in computational geometry is bounding the complexity of the lower envelope of n un
Add to Reading List

Open Document

File Size: 468,52 KB

Share Result on Facebook
UPDATE