A deterministic polynomial-time algorithm for the first Bertini theorem. II

DOI10.1007/s10958-014-1968-yzbMath1326.14140OpenAlexW4249518536MaRDI QIDQ2256657

Alexander L. Chistov

Publication date: 20 February 2015

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-014-1968-y

zbMATH Keywords

polynomial algorithmfirst Bertini theorem

Mathematics Subject Classification ID

Computational aspects of higher-dimensional varieties (14Q15)

Related Items

A deterministic polynomial-time algorithm for the first Bertini theorem. III

Cites Work

• Unnamed Item
• Unnamed Item
• A deterministic polynomial-time algorithm for the first Bertini theorem. I
• Polynomial-time computation of the degree of a dominant morphism in zero characteristic. IV.
• 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
• Vandermonde matrices, NP-completeness and transversal subspaces
• Monodromy and irreducibility criteria with algorithmic applications in characteristic zero
• A bound for the degree of a system of equations determining the variety of reducible polynomials
• 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