東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Parameterized algorithms

Cygan, Marek.

FindBook

Google Book

Amazon

博客來

Parameterized algorithms

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Parameterized algorithms/ by Marek Cygan ... [et al.].
其他作者:	Cygan, Marek.
出版者:	Cham :Springer International Publishing : : 2015.,
面頁冊數:	xvii, 613 p. :ill. (some col.), digital ;24 cm.
內容註:	Introduction -- Kernelization -- Bounded Search Trees -- Iterative Compression -- Randomized Methods in Parameterized Algorithms -- Miscellaneous -- Treewidth -- Finding Cuts and Separators -- Advanced Kernelization Algorithms -- Algebraic Techniques: Sieves, Convolutions, and Polynomials -- Improving Dynamic Programming on Tree Decompositions -- Matroids -- Fixed-Parameter Intractability -- Lower Bounds Based on the Exponential-Time Hypothesis -- Lower Bounds for Kernelization.
Contained By:	Springer eBooks
標題:	Parameter estimation. -
電子資源:	http://dx.doi.org/10.1007/978-3-319-21275-3
ISBN:	9783319212753 (electronic bk.)

Parameterized algorithms
Parameterized algorithms[electronic resource] /by Marek Cygan ... [et al.]. - Cham :Springer International Publishing :2015. - xvii, 613 p. :ill. (some col.), digital ;24 cm.

Introduction -- Kernelization -- Bounded Search Trees -- Iterative Compression -- Randomized Methods in Parameterized Algorithms -- Miscellaneous -- Treewidth -- Finding Cuts and Separators -- Advanced Kernelization Algorithms -- Algebraic Techniques: Sieves, Convolutions, and Polynomials -- Improving Dynamic Programming on Tree Decompositions -- Matroids -- Fixed-Parameter Intractability -- Lower Bounds Based on the Exponential-Time Hypothesis -- Lower Bounds for Kernelization.

ISBN: 9783319212753 (electronic bk.)

Standard No.: 10.1007/978-3-319-21275-3doiSubjects--Topical Terms:

567557
Parameter estimation.

LC Class. No.: QA276.8

Dewey Class. No.: 519.544

Parameterized algorithms
LDR:01383nmm a2200301 a 4500 001 2008866
003 DE-He213
005 20160223103102.0
006 m d
007 cr nn 008maaau
008 160311s2015 gw s 0 eng d
020 $a 9783319212753 (electronic bk.)
020 $a 9783319212746 (paper)
024 7 $a 10.1007/978-3-319-21275-3 $2 doi
035 $a 978-3-319-21275-3
040 $a GP $c GP
041 0 $a eng
050 4 $a QA276.8
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
082 0 4 $a 519.544 $2 23
090 $a QA276.8 $b .P222 2015
245 0 0 $a Parameterized algorithms $h [electronic resource] / $c by Marek Cygan ... [et al.].
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a xvii, 613 p. : $b ill. (some col.), digital ; $c 24 cm.
505 0 $a Introduction -- Kernelization -- Bounded Search Trees -- Iterative Compression -- Randomized Methods in Parameterized Algorithms -- Miscellaneous -- Treewidth -- Finding Cuts and Separators -- Advanced Kernelization Algorithms -- Algebraic Techniques: Sieves, Convolutions, and Polynomials -- Improving Dynamic Programming on Tree Decompositions -- Matroids -- Fixed-Parameter Intractability -- Lower Bounds Based on the Exponential-Time Hypothesis -- Lower Bounds for Kernelization.
650 0 $a Parameter estimation. $3 567557
650 0 $a Computer algorithms. $3 523872
650 0 $a Computer science $x Mathematics. $3 532725
650 1 4 $a Computer Science. $3 626642
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 891007
650 2 4 $a Algorithms. $3 536374
700 1 $a Cygan, Marek. $3 2114931
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-21275-3
950 $a Computer Science (Springer-11645)