000 03944nam a22005295i 4500
001 978-3-030-41672-0
003 DE-He213
005 20240423125158.0
007 cr nn 008mamaa
008 200220s2020 sz | s |||| 0|eng d
020 _a9783030416720
_9978-3-030-41672-0
024 7 _a10.1007/978-3-030-41672-0
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
072 7 _aUMB
_2thema
082 0 4 _a518.1
_223
245 1 0 _aComplexity and Approximation
_h[electronic resource] :
_bIn Memory of Ker-I Ko /
_cedited by Ding-Zhu Du, Jie Wang.
250 _a1st ed. 2020.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2020.
300 _aX, 289 p. 42 illus., 25 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v12000
505 0 _aIn 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.
520 _aThis 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.
650 0 _aAlgorithms.
650 0 _aMathematics.
650 1 4 _aAlgorithms.
650 2 4 _aApplications of Mathematics.
700 1 _aDu, Ding-Zhu.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aWang, Jie.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030416713
776 0 8 _iPrinted edition:
_z9783030416737
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v12000
856 4 0 _uhttps://doi.org/10.1007/978-3-030-41672-0
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c175114
_d175114