From post

On Lovász' Lattice Reduction and the Nearest Lattice Point Problem (Shortened Version).

. STACS, том 182 из Lecture Notes in Computer Science, стр. 13-20. Springer, (1985)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Multiplicative Equations over Commuting Matrices., , , , и . SODA, стр. 498-507. ACM/SIAM, (1996)A Las Vegas-NC Algorithm for isomorphism of graphs with bounded multiplicity of eigenvalues. FOCS, стр. 303-312. IEEE Computer Society, (1986)Fast Monte Carlo Algorithms for Permutation Groups., , , , и . J. Comput. Syst. Sci., 50 (2): 296-308 (1995)Matrix Rigidity Depends on the Target Field., и . CCC, том 200 из LIPIcs, стр. 41:1-41:26. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Polynomial-time Isomorphism Test for Groups with Abelian Sylow Towers., и . STACS, том 14 из LIPIcs, стр. 453-464. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)Evasiveness and the Distribution of Prime Numbers., , , и . STACS, том 5 из LIPIcs, стр. 71-82. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)Fast Management of Permutation Groups, , и . FOCS, стр. 272-282. IEEE Computer Society, (1988)Quasipolynomial-time canonical form for steiner designs., и . STOC, стр. 261-270. ACM, (2013)Isomorhism of Hypergraphs of Low Rank in Moderately Exponential Time., и . FOCS, стр. 667-676. IEEE Computer Society, (2008)On the Diameter of Finite Groups, , , , и . FOCS, стр. 857-865. IEEE Computer Society, (1990)0-8186-2082-X.