First Page | Document Content | |
---|---|---|
Date: 2012-06-29 03:18:26Computer science Mathematics Computational complexity theory Analysis of algorithms Combinatorial optimization Theoretical computer science Parametric search Computational geometry Algorithm Time complexity Selection algorithm Bounding sphere | Algorithmic Techniques for Geometric Optimization? Pankaj K. Agarwal1 and Micha Sharir2;3 1 Department of Computer Science Box 90129, Duke University, Durham, NC, USA.Add to Reading ListSource URL: www.math.tau.ac.ilDownload Document from Source WebsiteFile Size: 257,86 KBShare Document on Facebook |
Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of viewDocID: 1xVR3 - View Document | |
Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗DocID: 1xUAX - View Document | |
Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcsDocID: 1xUr4 - View Document | |
Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingenDocID: 1xTuz - View Document | |
CS 153 Current Topics in Theoretical Computer Science Spring 2016DocID: 1vryF - View Document |