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

DOI10.1007/s10958-013-1655-4zbMath1304.14076OpenAlexW1994039859MaRDI QIDQ744549

Alexander 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)

Related Items (4)

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 ⋮ Inequalities for Hilbert functions and primary decompositions ⋮ A deterministic polynomial-time algorithm for the first Bertini theorem. III

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Polynomial-Time Computation of the Degree of a Dominant Morphism in Characteristic Zero. I
• Pencils on an Algebraic Variety and a New Proof of a Theorem of Bertini
• 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.

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