Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques / Lecture Notes in Computer Science Bd.2764 (PDF)
This book constitutes the joint refereed proceedings of the 6th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2003 and of the 7th International Workshop on Randomization and Approximation Techniques in Computer...
26 DeutschlandCard Punkte
sammeln
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenloser tolino webreader
This book constitutes the joint refereed proceedings of the 6th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2003 and of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, held in Princeton, NY, USA in August 2003.
The 33 revised full papers presented were carefully reviewed and selected from 74 submissions. Among the issues addressed are design and analysis of randomized and approximation algorithms, online algorithms, complexity theory, combinatorial structures, error-correcting codes, pseudorandomness, derandomization, network algorithms, random walks, Markov chains, probabilistic proof systems, computational learning, randomness in cryptography, and various applications.
- 2003, 2003, 411 Seiten, Englisch
- Herausgegeben: Sanjeev Arora, Klaus Jansen, Jose D. P. Rolim, Amit Sahai
- Verlag: Springer Berlin Heidelberg
- ISBN-10: 3540451986
- ISBN-13: 9783540451983
- Erscheinungsdatum: 15.12.2003
Abhängig von Bildschirmgröße und eingestellter Schriftgröße kann die Seitenzahl auf Ihrem Lesegerät variieren.
- Dateiformat: PDF
- Größe: 3.77 MB
- Ohne Kopierschutz
- Vorlesefunktion
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques / Lecture Notes in Computer Science Bd.2764".
Kommentar verfassen