On Unknown Small Subsets and Implicit Measures： New Techniques for Parameterized Algorithms

Parameterized computation is a recently proposed alternative approach to dealing with NP-hard problems.Developing efficient parameterized algorithms has become a very active research area in the current research in theoretical computer science. In this paper, we investigate a number of new algorithm...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of computer science and technology Ročník 29; číslo 5; s. 870 - 878
Hlavný autor:	陈建二冯启龙
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Boston Springer US 01.09.2014 Springer Nature B.V
Predmet:	Algorithms Artificial Intelligence Computation Computer Science Data Structures and Information Theory Information Systems Applications (incl.Internet) NP难问题 Parameterization Regular Paper Software Engineering Theory of Computation 亚群参数算法技术算法参数计算机科学高效算法 randomized method parameterized computation implicit branching
ISSN:	1000-9000, 1860-4749
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!