Complexity and Approximation : In Memory of Ker-I Ko

Jie Wang

ISBN 10: 3030416712 / ISBN 13: 9783030416713

Published by Springer International Publishing, Springer International Publishing, 2020

About this Item

Druck auf Anfrage Neuware - Printed after ordering - 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.

Seller Inventory # 9783030416713

Bibliographic Details

• Title: Complexity and Approximation : In Memory of Ker-I Ko
• Publisher: Springer International Publishing, Springer International Publishing
• Publication Date: 2020
• Language: English
• ISBN 10: 3030416712
• ISBN 13: 9783030416713
• Binding: Taschenbuch
• Condition: Neu

About this title

Synopsis

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.