Complexity and Approximation / Lecture Notes in Computer Science Bd.12000 (PDF)
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenloser tolino webreader
This Festschrift is in honor of Ker-I Ko, Professor in the Stony Brook University, USA. Ker-I Ko was one of the founding fathers of computational complexity over real numbers and analysis. He and Harvey Friedman devised a theoretical model for real number computations by extending the computation of Turing machines. He contributed signi¿cantly to advancing the theory of structural complexity, especially on polynomial-time isomorphism, instance complexity, and relativization of polynomial-time hierarchy. Ker-I also made many contributions to approximation algorithm theory of combinatorial optimization problems. This volume contains 17 contributions in the area of complexity and approximation. Those articles are authored by researchers over the world, including North America, Europe and Asia. Most of them are co-authors, colleagues, friends, and students of Ker-I Ko.
- 2020, 1st ed. 2020, 289 Seiten, Englisch
- Herausgegeben: Ding-Zhu Du, Jie Wang
- Verlag: Springer-Verlag GmbH
- ISBN-10: 3030416720
- ISBN-13: 9783030416720
- Erscheinungsdatum: 20.02.2020
Abhängig von Bildschirmgröße und eingestellter Schriftgröße kann die Seitenzahl auf Ihrem Lesegerät variieren.
- Dateiformat: PDF
- Größe: 10 MB
- Ohne Kopierschutz
- Vorlesefunktion
Schreiben Sie einen Kommentar zu "Complexity and Approximation / Lecture Notes in Computer Science Bd.12000".
Kommentar verfassen