Vertebra
发表于 2025-3-23 09:47:33
http://reply.papertrans.cn/75/7412/741158/741158_11.png
Expertise
发表于 2025-3-23 14:25:28
http://reply.papertrans.cn/75/7412/741158/741158_12.png
stroke
发表于 2025-3-23 18:37:50
http://reply.papertrans.cn/75/7412/741158/741158_13.png
DOTE
发表于 2025-3-24 01:41:37
http://reply.papertrans.cn/75/7412/741158/741158_14.png
xanthelasma
发表于 2025-3-24 05:33:27
Kernelization: New Upper and Lower Bound Techniques,nction of a parameter. Several results of recent research on kernelization are mentioned. This survey looks at some recent results where a general technique shows the existence of kernelization algorithms for large classes of problems, in particular for planar graphs and generalizations of planar gr
Picks-Disease
发表于 2025-3-24 06:56:38
http://reply.papertrans.cn/75/7412/741158/741158_16.png
shrill
发表于 2025-3-24 13:39:03
Planar Capacitated Dominating Set Is ,-Hard,. which maps every vertex in (.(.) ∖ .) to one of its neighbors such that the total number of vertices mapped by . to any vertex . ∈ . does not exceed .(.). In the . problem we are given a planar graph ., a capacity function . and a positive integer . and asked whether . has a capacitated dominating
流动才波动
发表于 2025-3-24 15:27:38
http://reply.papertrans.cn/75/7412/741158/741158_18.png
LARK
发表于 2025-3-24 20:54:58
The Complexity of Satisfiability of Small Depth Circuits, exponentially better than a brute force search. We show an improved randomized algorithm for the satisfiability problem for circuits of constant depth . and a linear number of gates .: for each . and ., the running time is 2. where the improvement ., and the constant in the big-Oh depends only on .
Surgeon
发表于 2025-3-24 23:45:35
http://reply.papertrans.cn/75/7412/741158/741158_20.png