Polynomial-time computation of the degree of a dominant morphism in zero characteristic. IV.
From MaRDI portal
Publication:1037007
DOI10.1007/s10958-009-9413-3zbMath1173.14347OpenAlexW2006395910MaRDI QIDQ1037007
Publication date: 13 November 2009
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-009-9413-3
Rational and birational maps (14E05) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)
Related Items
A deterministic polynomial-time algorithm for the first Bertini theorem. II ⋮ A deterministic polynomial-time algorithm for the first Bertini theorem. III
Cites Work
- Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
- Polynomial-time computation of the dimensions of components of algebraic varieties in zero-characteristic
- Efficient smooth stratification of an algebraic variety in zero characteristic and its applications
- Monodromy and irreducibility criteria with algorithmic applications in characteristic zero
- Polynomial-Time Computation of the Degree of a Dominant Morphism in Characteristic Zero. I
- Strong version of the basic deciding algorithm for the existential theory of real fields
- Representation theory, dynamical systems, combinatorial and algorithmic methods . Part 4. Transl. from the Russian
- Unnamed Item
- Unnamed Item
- Unnamed Item
