Monomial bases and polynomial system solving (extended abstract)
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Algorithm 795: PHCpack: a general-purpose solver for polynomial systems by homotopy continuation
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Mathematical Software (TOMS)
Journal of Computational and Applied Mathematics - Proceedings of the international conference on recent advances in computational mathematics
A Concise Guide to Complex Hadamard Matrices
Open Systems & Information Dynamics
Newton's method with deflation for isolated singularities of polynomial systems
Theoretical Computer Science
ACM Transactions on Mathematical Software (TOMS)
Certifying properties of an efficient functional program for computing Gröbner bases
Journal of Symbolic Computation
HOM4PS-2.0para: Parallelization of HOM4PS-2.0 for solving polynomial systems
Parallel Computing
Exploiting single-cycle symmetries in continuous constraint problems
Journal of Artificial Intelligence Research
Parallelization of Modular Algorithms
Journal of Symbolic Computation
The monomial representations of the Clifford group
Quantum Information & Computation
Gröbner bases of symmetric ideals
Journal of Symbolic Computation
Almost Hadamard matrices: The case of arbitrary exponents
Discrete Applied Mathematics
Hi-index | 0.00 |
This paper deals with the problem of using symbolic algebra to count the solutions of inhomogeneous systems of algebraic equations. A trick is presented whereby the faster algorithms for the homogeneous case can be used in the inhomogeneous case. The method is applied to the cyclic n-roots studied by one of the authors (and sometimes referred to as solutions to Amborg's system or Davenport's problem).