Randomization and Approximation Techniques in Computer Science: International Workshop RANDOM'97, Bologna, Italy, July 11-12, 1997 ProceedingsJose Rolim Springer Science & Business Media, 25.06.1997 - 225 Seiten Astronomy is the oldest and most fundamental of the natural sciences. From the early beginnings of civilization astronomers have attempted to explain not only what the Universe is and how it works, but also how it started, how it evolved to the present day, and how it will develop in the future. The author, a well-known astronomer himself, describes the evolution of astronomical ideas, briefly discussing most of the instrumental developments. Using numerous figures to elucidate the mechanisms involved, the book starts with the astronomical ideas of the Egyptian and Mesopotamian philosophers, moves on to the Greek period, and then to the golden age of astronomy, i.e. to Copernicus, Galileo, Kepler, and Newton, and ends with modern theories of cosmology. Written with undergraduate students in mind, this book gives a fascinating survey of astronomical thinking. |
Inhalt
I | 1 |
IV | 15 |
V | 27 |
VI | 43 |
VII | 55 |
VIII | 57 |
IX | 67 |
X | 85 |
XIII | 119 |
XIV | 135 |
XV | 151 |
XVI | 165 |
XVII | 175 |
XVIII | 187 |
XIX | 197 |
XX | 213 |
Andere Ausgaben - Alle anzeigen
Randomization and Approximation Techniques in Computer Science ... Jose Rolim Keine Leseprobe verfügbar - 2014 |
Häufige Begriffe und Wortgruppen
1-way Monte Carlo 2-way finite A-random approximation algorithm arbitrary assigned Bellman-Ford algorithm Boolean Carlo pushdown automaton combinatorial compendium completion compression Computer Science concave cells conjecture constant construction corresponding cycle defined definition denote deterministic distribution e-biased edge lengths Euler tour exists finite automaton fractional schedule function f given greedy algorithm Hence high probability independent input word integer Lemma log np low-degree tests lower bound LP relaxation machine Markov chain martingale matrix MAX-SNP measure Monte Carlo pushdown node non-deterministic NP optimization problems NP-complete NP-hard number of squares O(n log O(n² output P/poly pair path polygon polynomial polynomial-time precedence constraints probabilistic properties Proposition prove pseudorandom pushdown automata random variables randomized algorithm resource-bounded row-sequence sequence shortest shortest-paths problem single-source shortest-paths problem step strings subset super-bit Theorem theory tree uniformly unsafe approximation vertex vertices Voronoi winners