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

DOI10.1007/S10958-013-1655-4MaRDI QIDQ744549zbMATH OpenOpenAlexFDO

Authors A. L. Chistov

Publication date 25 September 2014

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

Full work available at URL https://doi.org/10.1007/s10958-013-1655-4

Mathematics Subject Classification ID

Computational aspects of higher-dimensional varieties (14Q15)

Recommendations

• A deterministic polynomial-time algorithm for the first Bertini theorem. II
• A deterministic polynomial-time algorithm for the first Bertini theorem. III
• An effective version of the first Bertini theorem in nonzero characteristic and its applications
• Polynomial-time computation of the degree of a dominant morphism in zero characteristic. IV.
• scientific article; zbMATH DE number 2214061

Cites work

• scientific article; zbMATH DE number 3893304 (Why is no real title available?)
• scientific article; zbMATH DE number 2214061 (Why is no real title available?)
• Efficient smooth stratification of an algebraic variety in zero characteristic and its applications
• Monodromy and irreducibility criteria with algorithmic applications in characteristic zero
• Pencils on an Algebraic Variety and a New Proof of a Theorem of Bertini
• Polynomial-Time Computation of the Degree of a Dominant Morphism in Characteristic Zero. I
• Polynomial-time computation of the degree of algebraic varieties in zero characteristic and its applications.
• Polynomial-time computation of the dimensions of components of algebraic varieties in zero-characteristic
• Strong version of the basic deciding algorithm for the existential theory of real fields
• Vandermonde matrices, NP-completeness and transversal subspaces

Cited in

(6)

• A deterministic method for computing Bertini type invariants of parametric ideals
• An effective version of the first Bertini theorem in nonzero characteristic and its applications
• A deterministic polynomial-time algorithm for the first Bertini theorem. III
• Counting irreducible components of complex algebraic varieties
• Inequalities for Hilbert functions and primary decompositions
• A deterministic polynomial-time algorithm for the first Bertini theorem. II

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744549)