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

DOI10.1007/S10958-015-2543-XzbMATH Open1326.14141OpenAlexW4232211475MaRDI QIDQ748510FDOQ748510

Authors: A. 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

Recommendations

• A deterministic polynomial-time algorithm for the first Bertini theorem. II
• 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.
• An effective version of the first Bertini theorem in nonzero characteristic and its applications
• scientific article; zbMATH DE number 2214061

Mathematics Subject Classification ID

Computational aspects of higher-dimensional varieties (14Q15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Vandermonde matrices, NP-completeness and transversal subspaces
• A deterministic polynomial-time algorithm for the first Bertini theorem. I
• 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
• Polynomial-time computation of the degree of algebraic varieties in zero characteristic and its applications.
• Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
• Polynomial-time computation of the degree of a dominant morphism in zero characteristic. IV.
• A deterministic polynomial-time algorithm for the first Bertini theorem. II
• Effective construction of local parameters of irreducible components of an algebraic variety.
• A bound for the degree of a system of equations determining the variety of reducible polynomials
• Title not available (Why is that?)

Cited In (8)

• Effective Bertini theorem and formulas for multiplicity and the local Łojasiewicz exponent
• Title not available (Why is that?)
• Polynomial-time computation of the degree of a dominant morphism in zero characteristic. IV.
• 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. II
• A deterministic polynomial-time algorithm for the first Bertini theorem. I
• Effective construction of local parameters of irreducible components of an algebraic variety.

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

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