國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Complexity and approximationin memor...

Du, Ding-Zhu.

Complexity and approximationin memory of Ker-I Ko /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Complexity and approximationedited by Ding-Zhu Du, Jie Wang.
其他題名:	in memory of Ker-I Ko /
其他作者:	Du, Ding-Zhu.
出版者:	Cham :Springer International Publishing :2020.
面頁冊數:	x, 289 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer eBooks
標題:	Computational complexity
電子資源:	https://doi.org/10.1007/978-3-030-41672-0
ISBN:	9783030416720$q(electronic bk.)

Complexity and approximationin memory of Ker-I Ko /
Complexity and approximationin memory of Ker-I Ko /[electronic resource] :edited by Ding-Zhu Du, Jie Wang. - Cham :Springer International Publishing :2020. - x, 289 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,120000302-9743 ;. - Lecture notes in computer science ;4891..

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$q(electronic bk.)

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

253942
Computational complexity

LC Class. No.: QA267.7 / .C65 2020

Dewey Class. No.: 511.3

Complexity and approximationin memory of Ker-I Ko /
LDR:03161nmm a2200349 a 4500 001 574779
003 DE-He213
005 20200224162724.0
006 m d
007 cr nn 008maaau
008 201016s2020 sz s 0 eng d
020 $a 9783030416720$q(electronic bk.)
020 $a 9783030416713$q(paper)
024 7 $a 10.1007/978-3-030-41672-0 $2 doi
035 $a 978-3-030-41672-0
040 $a GP $c GP
041 0 $a eng
050 4 $a QA267.7 $b .C65 2020
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 511.3 $2 23
090 $a QA267.7 $b .C737 2020
245 0 0 $a Complexity and approximation $h [electronic resource] : $b in memory of Ker-I Ko / $c edited by Ding-Zhu Du, Jie Wang.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a x, 289 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 12000
490 1 $a Theoretical computer science and general issues
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 0 $a Computational complexity $3 253942
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 273702
650 2 4 $a Mathematics of Algorithmic Complexity. $3 675328
700 1 $a Du, Ding-Zhu. $3 253890
700 1 $a Wang, Jie. $3 227117
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
830 0 $a Theoretical computer science and general issues. $3 822018
856 4 0 $u https://doi.org/10.1007/978-3-030-41672-0
950 $a Computer Science (Springer-11645)