Venules
发表于 2025-3-27 00:22:58
http://reply.papertrans.cn/24/2348/234760/234760_31.png
痛苦一下
发表于 2025-3-27 02:51:42
1.2 List of symbols and abbreviations,hin Hamming distance . of a given binary query string .. We present an algorithm to determine if there is a member in . within . of a given query string . of length .. The method takes time .(..+1) in the RAM model, independent of ., and requires .(.) additional space.
vasculitis
发表于 2025-3-27 08:50:08
https://doi.org/10.1007/3-540-45655-4Automat; algorithms; automata; combinatorial optimization; combinatorics; complexity; complexity theory; co
强化
发表于 2025-3-27 11:12:26
978-3-540-43996-7Springer-Verlag Berlin Heidelberg 2002
heterogeneous
发表于 2025-3-27 13:47:54
http://reply.papertrans.cn/24/2348/234760/234760_35.png
gospel
发表于 2025-3-27 21:21:11
Polynomial Interpolation of the Elliptic Curve and XTR Discrete LogarithmWe prove lower bounds on the degree of polynomials interpolating the discrete logarithm in the group of points on an elliptic curve over a finite field and the XTR discrete logarithm, respectively.
Vulvodynia
发表于 2025-3-28 00:54:56
On Higher Arthur-Merlin Classesfine, and a number of interactions between these operators and the standard polynomial time hierarchy. We prove a hierarchy theorem for these higher Arthur-Merlin classes involving interleaving operators, and a theorem giving non-trivial upper bounds to the intersection of the complementary classes in the hierarchy.
athlete’s-foot
发表于 2025-3-28 05:52:56
http://reply.papertrans.cn/24/2348/234760/234760_38.png
曲解
发表于 2025-3-28 07:21:02
Inferring a Union of Halfspaces from Examplesimum cardinality set of halfspaces whose union covers all positive points and no negative points. We prove that approximation of this problem is at least as hard as approximation of graph coloring. On the other hand, we show that the two-dimensional case of the problem can be solved in polynomial time. Other related results are shown, too.
Infusion
发表于 2025-3-28 10:26:09
Dictionary Look-Up within Small Edit Distancehin Hamming distance . of a given binary query string .. We present an algorithm to determine if there is a member in . within . of a given query string . of length .. The method takes time .(..+1) in the RAM model, independent of ., and requires .(.) additional space.