Advertisement

Complexity and Approximation

In Memory of Ker-I Ko

  • Ding-Zhu Du
  • Jie Wang
Book
  • 1.4k Downloads

Part of the Lecture Notes in Computer Science book series (LNCS, volume 12000)

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 12000)

Table of contents

  1. Front Matter
    Pages i-x
  2. Ding-Zhu Du, Jie Wang
    Pages 1-7
  3. Jan-Hendrik Lorenz, Uwe Schöning
    Pages 57-66
  4. Xiaoming Sun, Yuan Sun, Jialin Zhang
    Pages 151-171
  5. Qingqin Nong, Suning Gong, Qizhi Fang, Dingzhu Du
    Pages 172-186
  6. Xujin Chen, Xiaodong Hu, Mengqi Zhang
    Pages 187-204
  7. Feiteng Zhang, Bin Liu, Qizhi Fang
    Pages 205-218
  8. Vincent Chau, Minming Li
    Pages 219-229
  9. Erfang Shan, Jilei Shi, Wenrong Lv
    Pages 230-237
  10. Chi-Yeh Chen, Sun-Yuan Hsieh
    Pages 238-251
  11. Chuanwen Luo, Liya Xu, Deying Li, Weili Wu
    Pages 268-288
  12. Back Matter
    Pages 289-289

About this book

Introduction

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.

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

Editors and affiliations

  1. 1.The University of Texas at DallasRichardsonUSA
  2. 2.University of Massachusetts LowellLowellUSA

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-030-41672-0
  • Copyright Information Springer Nature Switzerland AG 2020
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-030-41671-3
  • Online ISBN 978-3-030-41672-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Materials & Steel
Automotive
Biotechnology
Finance, Business & Banking
Electronics
IT & Software
Telecommunications
Consumer Packaged Goods
Energy, Utilities & Environment
Aerospace