Andrew Novocin, Ph.D.
Affiliations: | 2008 | Florida State University, Tallahassee, FL, United States |
Area:
Mathematics, Computer ScienceGoogle:
"Andrew Novocin"Parents
Sign in to add mentor| Mark v. Hoeij | grad student | 2008 | Florida State | |
| (Factoring univariate polynomials over the rationals.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Elsheikh M, Giesbrecht M, Novocin A, et al. (2012) Fast computation of smith forms of sparse matrices over local rings Proceedings of the International Symposium On Symbolic and Algebraic Computation, Issac. 146-153 |
| van Hoeij M, Novocin A. (2012) Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials Algorithmica. 63: 616-633 |
| Hart W, Van Hoeij M, Novocin A. (2011) Practical polynomial factoring in polynomial time Proceedings of the International Symposium On Symbolic and Algebraic Computation, Issac. 163-170 |
| Novocin A, Stehlé D, Villard G. (2011) An LLL-reduction algorithm with quasi-linear time complexity: Extended abstract Proceedings of the Annual Acm Symposium On Theory of Computing. 403-412 |
| Hart W, Novocin A. (2011) Practical divide-and-conquer algorithms for polynomial arithmetic Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6885: 200-214 |
| Novocin A, Hoeij Mv. (2009) Factoring univariate polynomials over the rationals Acm Communications in Computer Algebra. 42: 157-157 |
| Novocin A. (2008) Factoring univariate polynomials over the rationals (abstract only) Acm Communications in Computer Algebra. 42: 85-85 |