找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Parameterized Complexity Theory; J?rg Flum,Martin Grohe Textbook 2006 Springer-Verlag Berlin Heidelberg 2006 Algorithms.Automat.algorithm.

[復(fù)制鏈接]
查看: 36162|回復(fù): 35
樓主
發(fā)表于 2025-3-21 17:49:12 | 只看該作者 |倒序瀏覽 |閱讀模式
書目名稱Parameterized Complexity Theory
編輯J?rg Flum,Martin Grohe
視頻videohttp://file.papertrans.cn/742/741149/741149.mp4
概述The previous definitive book on the area was the Springer title "Parameterized Complexity" by Downey and Fellows, which is now 6 years old..There are many important new results in the area to introduc
叢書名稱Texts in Theoretical Computer Science. An EATCS Series
圖書封面Titlebook: Parameterized Complexity Theory;  J?rg Flum,Martin Grohe Textbook 2006 Springer-Verlag Berlin Heidelberg 2006 Algorithms.Automat.algorithm.
描述.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..
出版日期Textbook 2006
關(guān)鍵詞Algorithms; Automat; algorithm; automata; complexity; complexity theory; computer; logic; programming; algori
版次1
doihttps://doi.org/10.1007/3-540-29953-X
isbn_softcover978-3-642-06757-0
isbn_ebook978-3-540-29953-0Series ISSN 1862-4499 Series E-ISSN 1862-4502
issn_series 1862-4499
copyrightSpringer-Verlag Berlin Heidelberg 2006
The information of publication is updating

書目名稱Parameterized Complexity Theory影響因子(影響力)




書目名稱Parameterized Complexity Theory影響因子(影響力)學(xué)科排名




書目名稱Parameterized Complexity Theory網(wǎng)絡(luò)公開度




書目名稱Parameterized Complexity Theory網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Parameterized Complexity Theory被引頻次




書目名稱Parameterized Complexity Theory被引頻次學(xué)科排名




書目名稱Parameterized Complexity Theory年度引用




書目名稱Parameterized Complexity Theory年度引用學(xué)科排名




書目名稱Parameterized Complexity Theory讀者反饋




書目名稱Parameterized Complexity Theory讀者反饋學(xué)科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 23:55:50 | 只看該作者
Parameterized Complexity Theory978-3-540-29953-0Series ISSN 1862-4499 Series E-ISSN 1862-4502
板凳
發(fā)表于 2025-3-22 03:28:30 | 只看該作者
地板
發(fā)表于 2025-3-22 08:16:16 | 只看該作者
5#
發(fā)表于 2025-3-22 11:48:30 | 只看該作者
6#
發(fā)表于 2025-3-22 15:14:04 | 只看該作者
https://doi.org/10.1007/3-540-29953-XAlgorithms; Automat; algorithm; automata; complexity; complexity theory; computer; logic; programming; algori
7#
發(fā)表于 2025-3-22 18:15:31 | 只看該作者
8#
發(fā)表于 2025-3-23 00:34:28 | 只看該作者
Huber will heute die Moser-Aktie auf Termin . in 3 Monaten kaufen. Der Termin-Kaufpreis betr?gt 129 €, der heutige Kurs der Moser-Aktie steht bei 120 €. W?hrend der n?chsten drei Monate fallen keine Dividenden an. Der 3-Monats-Marktzins betr?gt 4,5% p.a. ..
9#
發(fā)表于 2025-3-23 02:30:09 | 只看該作者
Wie im Vorwort bereits angedeutet, stammen die nachfolgenden Testklausuren aus Originalklausuren . am Fachbereich Wirtschaftswissenschaften der Fachhochschule Aachen und dokumentieren somit den geforderten Leistungsstandard in klassischer Finanzmathematik .. für angehende Betriebswirte.
10#
發(fā)表于 2025-3-23 06:50:28 | 只看該作者
Wie im Vorwort bereits angedeutet, stammen die nachfolgenden Testklausuren aus Originalklausuren . am Fachbereich Wirtschaftswissenschaften der Fachhochschule Aachen und dokumentieren somit den geforderten Leistungsstandard in klassischer Finanzmathematik .. für angehende Betriebswirte.
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-28 05:11
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
克拉玛依市| 二连浩特市| 景洪市| 西平县| 岢岚县| 凯里市| 泰州市| 绥化市| 天台县| 浠水县| 龙岩市| 西峡县| 平山县| 武平县| 昆明市| 信宜市| 洛隆县| 东阿县| 于田县| 乌兰察布市| 长治市| 岳普湖县| 曲麻莱县| 平罗县| 邵东县| 吉林市| 嘉峪关市| 巫山县| 长阳| 金山区| 徐水县| 通山县| 剑川县| 元氏县| 平阴县| 永德县| 安西县| 葫芦岛市| 八宿县| 聂荣县| 安康市|