John Abbott

From MaRDI portal



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!

PublicationDate of PublicationType
Computing the determinant of a dense matrix over \(\mathbb{Z}\)2024-11-13Paper
Certifying irreducibility in \(\mathbb{Z}[x\)]
Lecture Notes in Computer Science
2022-10-13Paper
Ideals modulo a prime
Journal of Algebra and its Applications
2021-05-12Paper
Computing and using minimal polynomials
Journal of Symbolic Computation
2020-03-24Paper
Gröbner bases for everyone with CoCoA-5 and CoCoALib
(available as arXiv preprint)
2019-03-11Paper
Fault-tolerant modular reconstruction of rational numbers
Journal of Symbolic Computation
2019-01-21Paper
CoCoA-5.2.2 and CoCoALib
ACM Communications in Computer Algebra
2018-08-03Paper
What is new in CoCoALib and CoCoA-5?
ACM Communications in Computer Algebra
2017-06-22Paper
Satisfiability checking and symbolic computation
ACM Communications in Computer Algebra
2017-06-21Paper
Satisfiability checking and symbolic computation
ACM Communications in Computer Algebra
2017-06-21Paper
Implicitization of hypersurfaces
Journal of Symbolic Computation
2017-01-16Paper
\textsf{SC}\(^2\): satisfiability checking meets symbolic computation. (Project paper)
Lecture Notes in Computer Science
2016-08-30Paper
Factorization in Z[x]
Proceedings of the 2000 international symposium on Symbolic and algebraic computation
2015-11-26Paper
Deciding if a variety forms an algebraic group2015-11-24Paper
Quadratic interval refinement for real roots
ACM Communications in Computer Algebra
2015-06-19Paper
What is new in CoCoA?
Mathematical Software – ICMS 2014
2014-09-08Paper
Integration of libnormaliz in CoCoALib and CoCoA 5
Mathematical Software – ICMS 2014
2014-09-08Paper
Bounds on factors in \(\mathbb Z[x\)]
Journal of Symbolic Computation
2013-01-10Paper
Twin-float arithmetic
Journal of Symbolic Computation
2012-05-04Paper
Polynomial factorisation: an exploration of Lenstra's algorithm
Lecture Notes in Computer Science
2011-04-16Paper
Integration: solving the Risch differential equation
Lecture Notes in Computer Science
2011-04-16Paper
CoCoALib: A C++ library for computations in commutative algebra\(\dots \) and beyond
Mathematical Software – ICMS 2010
2010-09-14Paper
Stable border bases for ideals of points
Journal of Symbolic Computation
2009-01-30Paper
Thinning out redundant empirical data
Mathematics in Computer Science
2008-01-22Paper
Computing zero-dimensional schemes
Journal of Symbolic Computation
2007-10-19Paper
How Tight is Hadamard's Bound?
Experimental Mathematics
2002-09-22Paper
How Tight is Hadamard's Bound?
Experimental Mathematics
2002-09-22Paper
Sparse squares of polynomials
Mathematics of Computation
2001-12-10Paper
Computing ideals of points
Journal of Symbolic Computation
2001-03-11Paper
scientific article; zbMATH DE number 17836 (Why is no real title available?)1992-06-26Paper
scientific article; zbMATH DE number 4069018 (Why is no real title available?)1988-01-01Paper
A Remark on a Paper by Wang: Another Surprising Property of 42
Mathematics of Computation
1988-01-01Paper
A remark on factorisation
ACM SIGSAM Bulletin
1985-01-01Paper
Cyclotomic Factors and LRS-Degeneracy
(available as arXiv preprint)
N/APaper
Computing the Determinant of a Dense Matrix over Z
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: John Abbott