國立虎尾科技大學 |

Complexity and Approximation = In Memory of Ker-I Ko /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Complexity and Approximation/ edited by Ding-Zhu Du, Jie Wang.
其他題名:	In Memory of Ker-I Ko /
其他作者:	Wang, Jie.
面頁冊數:	X, 289 p. 42 illus., 25 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Mathematics of Algorithmic Complexity. -
電子資源:	https://doi.org/10.1007/978-3-030-41672-0
ISBN:	9783030416720

Complexity and Approximation = In Memory of Ker-I Ko /
Complexity and ApproximationIn Memory of Ker-I Ko /[electronic resource] :edited by Ding-Zhu Du, Jie Wang. - 1st ed. 2020. - X, 289 p. 42 illus., 25 illus. in color.online resource. - Theoretical Computer Science and General Issues ;12000. - Theoretical Computer Science and General Issues ;9163.

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.

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.

ISBN: 9783030416720

Standard No.: 10.1007/978-3-030-41672-0doiSubjects--Topical Terms:

1020203
Mathematics of Algorithmic Complexity.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Complexity and Approximation = In Memory of Ker-I Ko /
LDR:03448nam a22004095i 4500 001 1026681
003 DE-He213
005 20200703094812.0
007 cr nn 008mamaa
008 210318s2020 gw | s |||| 0|eng d
020 $a 9783030416720 $9 978-3-030-41672-0
024 7 $a 10.1007/978-3-030-41672-0 $2 doi
035 $a 978-3-030-41672-0
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 005.1 $2 23
245 1 0 $a Complexity and Approximation $h [electronic resource] : $b In Memory of Ker-I Ko / $c edited by Ding-Zhu Du, Jie Wang.
250 $a 1st ed. 2020.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a X, 289 p. 42 illus., 25 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues ; $v 12000
505 0 $a 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.
520 $a 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.
650 2 4 $a Mathematics of Algorithmic Complexity. $3 1020203
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 0 $a Algorithms. $3 527865
700 1 $a Wang, Jie. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 681008
700 1 $a Du, Ding-Zhu. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 670906
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030416713
776 0 8 $i Printed edition: $z 9783030416737
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-030-41672-0
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)