Complexity and Approximation: In Memory of Ker-I Ko (1st ed. 2020) (Lecture Notes in Computer Science #12000)
By: and
Sign Up Now!
Already a Member? Log In
You must be logged into Bookshare to access this title.
Learn about membership options,
or view our freely available titles.
- 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.
- Copyright:
- 2020
Book Details
- Book Quality:
- Publisher Quality
- ISBN-13:
- 9783030416720
- Related ISBNs:
- 9783030416713
- Publisher:
- Springer International Publishing
- Date of Addition:
- 06/02/20
- Copyrighted By:
- Springer
- Adult content:
- No
- Language:
- English
- Has Image Descriptions:
- No
- Categories:
- Nonfiction, Computers and Internet, Mathematics and Statistics
- Submitted By:
- Bookshare Staff
- Usage Restrictions:
- This is a copyrighted book.
- Edited by:
- Jie Wang
- Edited by:
- Ding-Zhu Du