List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Generating subfields Proceedings of the 36th international symposium on Symbolic and algebraic computation | 2015-06-09 | Paper |
| An LLL-reduction algorithm with quasi-linear time complexity, extended abstract Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
| Generating subfields Journal of Symbolic Computation | 2013-03-11 | Paper |
| Gradual sub-lattice reduction and a new complexity for factoring polynomials Algorithmica | 2012-04-26 | Paper |
| Gradual sub-lattice reduction and a new complexity for factoring polynomials Lecture Notes in Computer Science | 2010-04-27 | Paper |
Research outcomes over time
This page was built for person: Andrew Novocin
