Complexity and Approximation
In Memory of Ker-I Ko
Buch in deiner Nähe kaufen
Beschreibung
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.
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.
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
Autor*in
Ding-Zhu Du
Themen in »Complexity and Approximation«
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