forthy
发表于 2025-3-23 13:02:29
http://reply.papertrans.cn/87/8604/860332/860332_11.png
键琴
发表于 2025-3-23 17:49:02
On the single-operation worst-case time complexity of the disjoint set union problem,n time complexity in the worst-case. Also we define a class of algorithms for the disjoint set union problem, which includes the class of algorithms defined by Tarjan. We prove that any algorithm from this class has at least ω(log n/loglog n) single-operation time complexity in the worst-case.
多产鱼
发表于 2025-3-23 18:13:29
http://reply.papertrans.cn/87/8604/860332/860332_13.png
Anthem
发表于 2025-3-24 02:00:46
Non-deterministic two-tape automata are more powerful than deterministic ones,grammars. It is shown that, in contrast to the one-tape case, deterministic two-tape automata are less powerful than non-deterministic ones. The counterexample is closely related to a linear context-free language of unbounded degree of ambiguity.
coagulate
发表于 2025-3-24 03:25:10
http://reply.papertrans.cn/87/8604/860332/860332_15.png
Pantry
发表于 2025-3-24 07:28:32
http://reply.papertrans.cn/87/8604/860332/860332_16.png
Insubordinate
发表于 2025-3-24 10:49:21
,On Lovász’ lattice reduction and the nearest lattice point problem,(. = const.) to a given point in ... We prove that each of two straightforward fast heuristic procedures achieves this goal when applied to a lattice given by a Lovász-reduced basis. The verification of one of them requires proving a geometric feature of Lovász-reduced bases: a .. lower bound on the
needle
发表于 2025-3-24 16:50:08
http://reply.papertrans.cn/87/8604/860332/860332_18.png
Chipmunk
发表于 2025-3-24 20:44:13
http://reply.papertrans.cn/87/8604/860332/860332_19.png
痛苦一生
发表于 2025-3-25 00:54:21
Non-deterministic two-tape automata are more powerful than deterministic ones,e tape, they can read simultaneously from two tapes. They accept just the rational subsets of X* × Y*, and are closely related to linear context-free grammars. It is shown that, in contrast to the one-tape case, deterministic two-tape automata are less powerful than non-deterministic ones. The count