傻
发表于 2025-3-30 09:39:11
http://reply.papertrans.cn/59/5801/580051/580051_51.png
奇怪
发表于 2025-3-30 15:58:48
http://reply.papertrans.cn/59/5801/580051/580051_52.png
手段
发表于 2025-3-30 18:37:45
The Hardness of Local Certification of Finite-State Dynamics First, we study the problem . on arbitrary graphs and show that every PLS has certificates of size . (up to logarithmic factors). Then, we turn to the restriction of the problem on graphs of maximum degree .. Roughly, we show that the problem admits a PLS with certificates of size ., while every PL
Commonwealth
发表于 2025-3-30 22:57:11
Total Domination, Separated-Cluster, CD-Coloring: Algorithms and Hardnessnd .. For any graph ., we have . and .. First, we explore the connection of . problem to the well-known problem .. Note that . is known to be NP-Complete for . 3.. We generalize this result by proving that both the problems . and . are NP-Complete, and do not admit any subexponential-time algorithms
斜坡
发表于 2025-3-31 02:21:00
A BWT-Based Algorithm for Random de Bruijn Sequence Constructionnd on a laptop computer for orders up to 23, including outputting the sequence. It can be straightforwardly extended to any constant-size alphabet. To the best of our knowledge, this is the first practical algorithm for generating random dB sequences which is capable of producing . dB sequences. Apa
煞费苦心
发表于 2025-3-31 08:57:13
Sparse Suffix and LCP Array: Simple, Direct, Small, and Fastmber of suffixes with an LCP value greater than . is in ., matching the time of optimal yet much more complicated algorithms ; and . in the sense that they can be implemented using . . machine words. We also show that our second al
Canopy
发表于 2025-3-31 10:13:12
Faster Combinatorial ,-Clique Algorithmsve the state-of-the-art (even of non-combinatorial algorithms) for generalizations of the .-Clique problem. In particular, we give the first . algorithm for .-clique in hypergraphs and an . algorithm for listing . triangles in a graph.
倔强不能
发表于 2025-3-31 15:41:56
On Approximate Colored Path Countingn ., where . is an arbitrary constant in (0, 1); our solution not only has faster query time but also always returns a .-approximation. When designing .-approximate solutions, our techniques also yield an .(.)-word structure that can answer a colored type-2 path counting query in . time; this query
诱骗
发表于 2025-3-31 18:21:15
http://reply.papertrans.cn/59/5801/580051/580051_59.png
刺耳
发表于 2025-3-31 21:51:38
Gonzalo Navarro,Cristian Urbinae subject such as the collection, representation, management, and methods of extracting grammatical information from discourse and conversational data as well as the relationship between questionnaire-based elicitation, text-based elicitation, and philology, and the need for combinations of these me