![](https://www.pdfsearch.io/img/7a88d2f595a98f29a17b63d6ba4c03dd.jpg)
| | 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 unAdd to Reading ListSource URL: web.eecs.umich.eduDownload Document from Source Website File Size: 468,52 KBShare Document on Facebook
|