Abstract
Culturally, computer scientists are generally trained in discrete mathematics; but continuous methods can give us surprising insights into many algorithms and combinatorial problems. In this pedagogical talk, I will describe two interesting places where continuous mathematics makes an entrance into computer science: proving lower bounds on the 3-colorability threshold in random graphs using differential equations, and a continuous-time version of Karmarkar’s algorithm for Linear Programming, based on the so-called Newton Barrier Flow.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moore, C. (2010). Continuous and Discrete Methods in Computer Science. In: López-Ortiz, A. (eds) LATIN 2010: Theoretical Informatics. LATIN 2010. Lecture Notes in Computer Science, vol 6034. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12200-2_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-12200-2_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12199-9
Online ISBN: 978-3-642-12200-2
eBook Packages: Computer ScienceComputer Science (R0)