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...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of computer science and technology Vol. 29; no. 5; pp. 870 - 878
Main Author:	陈建二冯启龙
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.09.2014 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!