Overview
- This Festschrift is in honor of Ker-I Ko, who was one of the founding fathers of computational complexity over real numbers and analysis
- Professor Ker-I Ko was one of the key players in the areas of Computational Complexity Theory, Complexity Theory of Real Functions, and Combinatorial Optimization
- This volume contains 17 contributions in the area of complexity and approximation, authored by co-authors, colleagues, friends, and students of Ker-I Ko
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 12000)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (17 chapters)
-
Front Matter
-
Back Matter
Keywords
- real functions
- complexity and approximation
- combinatorial optimization
- complexity theory of real functions
- byzantine robots
- Steiner tree problems
- blockchain technologies
- complexity theory
- enumerative counting
- self-reducibility
- probability distributions
- network design
- computability
- mobile robots
- parallel search
- byzantine fault
- algorithm
- approximation
- algorithm analysis and problem complexity
- algorithmic complexity
About this book
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 significantly 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.
Editors and Affiliations
Bibliographic Information
Book Title: Complexity and Approximation
Book Subtitle: In Memory of Ker-I Ko
Editors: Ding-Zhu Du, Jie Wang
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-030-41672-0
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer Nature Switzerland AG 2020
Softcover ISBN: 978-3-030-41671-3Published: 21 February 2020
eBook ISBN: 978-3-030-41672-0Published: 20 February 2020
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: X, 289
Number of Illustrations: 17 b/w illustrations, 25 illustrations in colour
Topics: Algorithm Analysis and Problem Complexity, Mathematics of Algorithmic Complexity