Complexity and Approximation

Jie Wang

ISBN 10: 3030416712 / ISBN 13: 9783030416713

Published by Springer International Publishing, Springer Nature Switzerland Feb 2020, 2020

About this Item

Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 300 pp. Englisch.

Seller Inventory # 9783030416713

Bibliographic Details

• Title: Complexity and Approximation
• Publisher: Springer International Publishing, Springer Nature Switzerland Feb 2020
• Publication Date: 2020
• Language: English
• ISBN 10: 3030416712
• ISBN 13: 9783030416713
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 17D millimeters 235 millimeters width by 155 millimeters height by 17 millimeters depth
• Weight: 458 grams

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.