Inscrutable
发表于 2025-3-27 00:01:01
Parameterized Complexity of Superstring Problems,that such a parameterization does not admit a polynomial kernel up to some complexity assumption. We also obtain several results about “below guaranteed values” parameterization of the problem. We show that parameterization by compression admits a polynomial kernel while parameterization “below matching” is hard.
浮夸
发表于 2025-3-27 01:17:57
http://reply.papertrans.cn/24/2301/230007/230007_32.png
installment
发表于 2025-3-27 07:02:26
Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem, is known that this problem can be solved in . time. In this paper, we first propose an .-time algorithm for the problem based on interesting properties of boxed subsequences. Then, we give a further improved algorithm which runs in . time using preprocessed information on . and order-statistics trees.
DEAF
发表于 2025-3-27 13:08:02
http://reply.papertrans.cn/24/2301/230007/230007_34.png
MAL
发表于 2025-3-27 16:56:59
http://reply.papertrans.cn/24/2301/230007/230007_35.png
暂时别动
发表于 2025-3-27 17:56:39
http://reply.papertrans.cn/24/2301/230007/230007_36.png
有节制
发表于 2025-3-28 00:04:58
https://doi.org/10.1007/978-3-319-94523-1how that the problem is .-hard. In addition we consider restricted versions of the problem where a node can only participate in a bounded number of swaps. We show that the problem is .-hard under these restrictions as well.
结合
发表于 2025-3-28 02:36:54
http://reply.papertrans.cn/24/2301/230007/230007_38.png
meretricious
发表于 2025-3-28 07:35:05
http://reply.papertrans.cn/24/2301/230007/230007_39.png
TEN
发表于 2025-3-28 13:08:38
http://reply.papertrans.cn/24/2301/230007/230007_40.png