On a generalization of Stickelberger’s Theorem-Reference-Cited by-同舟云学术

On a generalization of Stickelberger’s Theorem

Published:2010-12 Issue:12 Volume:45 Page:1459-1470
ISSN:0747-7171
Container-title:Journal of Symbolic Computation
language:en
Short-container-title:Journal of Symbolic Computation

Author:

Scheiblechner Peter

Publisher

Elsevier BV

Subject

Computational Mathematics,Algebra and Number Theory

Reference38 articles.

1. Factoring rational polynomials over the complex numbers;Bajaj;SIAM J. Comput.,1993

2. Algorithms in Real Algebraic Geometry;Basu,2003

3. On computing the determinant in small parallel time using a small number of processors;Berkowitz;Inform. Process. Lett.,1984

4. Bounds for the degrees in the Nullstellensatz;Brownawell;Ann. of Math. (2),1987

5. Bürgisser, P., Cucker, F., 2004. Variations by complexity theorists on three themes of Euler, Bézout, Betti, and Poincaré. In: Krajíček, J. (Ed.), Complexity of Computations and Proofs. In: Quaderni di Matematica [Mathematics Series], vol. 13. Department of Mathematics, Seconda Università di Napoli, Caserta, pp. 73–152.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Effective approximation of the solutions of algebraic equations;Journal of Symbolic Computation;2022-03

2. Atypical points at infinity and algorithmic detection of the bifurcation locus of real polynomials;Mathematische Zeitschrift;2021-01-04

3. Stickelberger and the Eigenvalue Theorem;Commutative Algebra;2021

4. Effective de Rham cohomology — The general case;Communications in Contemporary Mathematics;2019-07-12

5. Reaching generalized critical values of a polynomial;Mathematische Zeitschrift;2013-10-01