Andrew Novocin

Publication Activity (10 Years)

Years Active: 2008-2015
Publications (10 Years): 0

Top Topics

Graph Theoretic

High Computational Complexity

Complexity Reduction

Top Venues

J. Symb. Comput.

Publications

Andrew Novocin, B. David Saunders, Alexander Stachnik, Bryan S. Youse
3-ranks for strongly regular graphs. PASCO (2015)
Mark van Hoeij, Jürgen Klüners, Andrew Novocin
Generating subfields. J. Symb. Comput. 52 (2013)
Mark van Hoeij, Andrew Novocin
Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials. Algorithmica 63 (3) (2012)
Andrew Novocin, Damien Stehlé, Gilles Villard
An LLL-reduction algorithm with quasi-linear time complexity: extended abstract. STOC (2011)
Mark van Hoeij, Jürgen Klüners, Andrew Novocin
Generating subfields. ISSAC (2011)
William Hart, Mark van Hoeij, Andrew Novocin
Practical polynomial factoring in polynomial time. ISSAC (2011)
William Hart, Andrew Novocin
Practical Divide-and-Conquer Algorithms for Polynomial Arithmetic. CASC (2011)
Mark van Hoeij, Andrew Novocin
Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials. LATIN (2010)
Mark van Hoeij, Andrew Novocin
Gradual sub-lattice reduction and a new complexity for factoring polynomials CoRR (2010)
Andrew Novocin
Factoring univariate polynomials over the rationals (abstract only). ACM Commun. Comput. Algebra 42 (1-2) (2008)