OPAC

検索結果一覧に戻る

Parameterized Complexity Theory / by J. Flum, M. Grohe
(Texts in Theoretical Computer Science. An EATCS Series. ISSN:18624502)

データ種別	電子ブック
版	1st ed. 2006.
出版者	(Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer)
出版年	2006
大きさ	XIII, 495 p : online resource
著者標目	*Flum, J author Grohe, M author SpringerLink (Online service)

所蔵情報を非表示

URL	巻　次	配架場所	請求記号	登録番号	コメント	刷　年	状　態	利用注記	ISBN	予約	請求メモ
URL		射水-電子	007	EB0003528	Computer Scinece R0 2005-6,2022-3				9783540299530

書誌詳細を非表示

一般注記	Fixed-Parameter Tractability -- Reductions and Parameterized Intractability -- The Class W[P] -- Logic and Complexity -- Two Fundamental Hierarchies -- The First Level of the Hierarchies -- The W-Hierarchy -- The A-Hierarchy -- Kernelization and Linear Programming Techniques -- The Automata-Theoretic Approach -- Tree Width -- Planarity and Bounded Local Tree Width -- Homomorphisms and Embeddings -- Parameterized Counting Problems -- Bounded Fixed-Parameter Tractability and Limited Nondeterminism -- Subexponential Fixed-Parameter Tractability Parameterized complexity theory is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic problems. The central notion of the theory, fixed-parameter tractability, has led to the development of various new algorithmic techniques and a whole new theory of intractability. This book is a state-of-the-art introduction to both algorithmic techniques for fixed-parameter tractability and the structural theory of parameterized complexity classes, and it presents detailed proofs of recent advanced results that have not appeared in book form before. Several chapters are each devoted to intractability, algorithmic techniques for designing fixed-parameter tractable algorithms, and bounded fixed-parameter tractability and subexponential time complexity. The treatment is comprehensive, and the reader is supported with exercises, notes, a detailed index, and some background on complexity theory and logic. The book will be of interest to computer scientists, mathematicians and graduate students engaged with algorithms and problem complexity HTTP:URL=https://doi.org/10.1007/3-540-29953-X
件　名	LCSH:Computer systems LCSH:Mathematical logic LCSH:Algorithms LCSH:Computer science LCSH:Machine theory FREE:Computer System Implementation FREE:Mathematical Logic and Foundations FREE:Algorithms FREE:Theory of Computation FREE:Formal Languages and Automata Theory
分　類	LCC:QA76.9.S88 DC23:004.2
書誌ID	EB00002916
ISBN	9783540299530