Lattice-Search Runtime Distributions May Be Heavy-Tailed

Filip Zelezný, Ashwin Srinivasan, David Page. Lattice-Search Runtime Distributions May Be Heavy-Tailed. In Stan Matwin, Claude Sammut, editors, Inductive Logic Programming, 12th International Conference, ILP 2002, Sydney, Australia, July 9-11, 2002. Revised Papers. Volume 2583 of Lecture Notes in Computer Science, pages 333-345, Springer, 2002. [doi]

Abstract

Abstract is missing.