AbstractWe simplify and improve our techniques of the association of long integers with polynomials for computations in the ring of integers and apply these techniques to the computation of the signs of matrix determinants, Sturm sequences, and other algebraic and geometric predicates
We consider first the zero-nonzero determination problem, which consists in determining the list of ...
Linear algebra, together with polynomial arithmetic, is the foundation of computer algebra. The algo...
The Hilbert–Kunz multiplicity and F-signature are important invariants for researchers in commutativ...
Sign determination is a fundamental problem in algebraic as well as geometric computing. It is the c...
Sign determination is a fundamental problem in algebraic as well as geometric computing. It is the c...
(eng) Computation of the sign of the determinant of a matrix and determinant itself is a challenge f...
AbstractWe review, modify, and combine together several numerical and algebraic techniques in order ...
AbstractComputation of the sign of the determinant of a matrix and the determinant itself is a chall...
AbstractA new and efficient number theoretic algorithm for evaluating signs of determinants is propo...
International audienceWe propose an efficient method that determines the sign of a multivariate poly...
Certified computation of the sign of the determinant of a matrix and determinant itself is a challen...
In an ordered algebraic extension field of the rationals algorithms for sign determinations are stud...
We give a specific method to solve with quadratic complexity the linear systems arising in known alg...
AbstractWe give a specific method to solve with quadratic complexity the linear systems arising in k...
AbstractThis paper presents a new encoding scheme for real algebraic number manipulations which enha...
We consider first the zero-nonzero determination problem, which consists in determining the list of ...
Linear algebra, together with polynomial arithmetic, is the foundation of computer algebra. The algo...
The Hilbert–Kunz multiplicity and F-signature are important invariants for researchers in commutativ...
Sign determination is a fundamental problem in algebraic as well as geometric computing. It is the c...
Sign determination is a fundamental problem in algebraic as well as geometric computing. It is the c...
(eng) Computation of the sign of the determinant of a matrix and determinant itself is a challenge f...
AbstractWe review, modify, and combine together several numerical and algebraic techniques in order ...
AbstractComputation of the sign of the determinant of a matrix and the determinant itself is a chall...
AbstractA new and efficient number theoretic algorithm for evaluating signs of determinants is propo...
International audienceWe propose an efficient method that determines the sign of a multivariate poly...
Certified computation of the sign of the determinant of a matrix and determinant itself is a challen...
In an ordered algebraic extension field of the rationals algorithms for sign determinations are stud...
We give a specific method to solve with quadratic complexity the linear systems arising in known alg...
AbstractWe give a specific method to solve with quadratic complexity the linear systems arising in k...
AbstractThis paper presents a new encoding scheme for real algebraic number manipulations which enha...
We consider first the zero-nonzero determination problem, which consists in determining the list of ...
Linear algebra, together with polynomial arithmetic, is the foundation of computer algebra. The algo...
The Hilbert–Kunz multiplicity and F-signature are important invariants for researchers in commutativ...
DOI
Add to ORKG