Anzeige
Erschienen in:
2010 | OriginalPaper | Buchkapitel
Continuous and Discrete Methods in Computer Science
verfasst von : Cristopher Moore
Erschienen in: LATIN 2010: Theoretical Informatics
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.