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

DOI10.1007/s10958-015-2543-xzbMath1326.14141OpenAlexW4232211475MaRDI QIDQ748510

Alexander L. Chistov

Publication date: 29 October 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-015-2543-x

Mathematics Subject Classification ID

Computational aspects of higher-dimensional varieties (14Q15)

Cites Work

• 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.
• 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
• Vandermonde matrices, NP-completeness and transversal subspaces
• A deterministic polynomial-time algorithm for the first Bertini theorem. II
• 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
• Polynomial-time computation of the degree of algebraic varieties in zero characteristic and its applications.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A deterministic polynomial-time algorithm for the first Bertini theorem. III