Go to main content

Complexity and approximation : in memory of Ker-I Ko / Ding-Zhu Du, Jie Wang (eds.).

Du, Dingzhu.; Wang, Jie.; International Workshop on Complexity and Approximation (2019 : Qingdao, China)
2020
QA267.7
Available Online
Formats
Format
BibTeX
MARCXML
TextMARC
MARC
DublinCore
EndNote
NLM
RefWorks
RIS
Add to Basket

Linked e-resources

Linked Resource
Online Access
Concurrent users
Unlimited
Authorized users
Authorized users
Document Delivery Supplied
Can lend chapters, not whole ebooks

Details

Title
Complexity and approximation : in memory of Ker-I Ko / Ding-Zhu Du, Jie Wang (eds.).
ISBN
9783030416720 (electronic book)
3030416720 (electronic book)
9783030416713
Published
Cham : Springer, 2020 .
Language
English
Description
1 online resource (x, 289 pages) : illustrations.
Item Number
10.1007/978-3-030-41
Call Number
QA267.7
Dewey Decimal Classification
511.3
005.1
Summary
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.
Note
Includes author index.
Access Note
Access limited to authorized users.
Added Author
Du, Dingzhu.
Wang, Jie.
Added Meeting Name
International Workshop on Complexity and Approximation (2019 : Qingdao, China)
Series
Lecture notes in computer science ; 12000.
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
Linked Resources
Online Access
Record Appears in
Online Resources > Ebooks
All Resources
In Memoriam: Ker-I Ko (1950-2018)
Ker-I Ko and the Study of Resource-Bounded Kolmogorov Complexity
The Power of Self-Reducibility Selectivity, Information, and Approximation
Who Asked Us
How the Theory of Computing Answers, QuestionsAbout Analysis
Promise Problems on Probability Distributions
On Nonadaptive Reductions to the Set of Random Strings and its Dense Subsets
Computability of the Solutions to Navier-Stokes Equations via Recursive Approximation
Automatic Generation of Structured Overviews over a Very Large Corpus of Documents
Better Upper Bounds for Searching on a Line with Byzantine Robots
A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions
Sequential Location Game on Continuous Directional Star Networks
Core Decomposition, Maintenance and Applications
Active and Busy Time Scheduling Problem: a Survey
A Note on the Position Value for Hypergraph Communication Situations
An Efficient Approximation Algorithm for the Steiner Tree Problem
A Review for Submodular Optimization on Machine Scheduling Problems
Edge Computing Integrated with Blockchain Technologies.

Browse Subjects

Show more subjects...

Statistics

from
to
Export