A deterministic polynomial-time algorithm for the first Bertini theorem. I
From MaRDI portal
Publication:744549
DOI10.1007/S10958-013-1655-4zbMATH Open1304.14076OpenAlexW1994039859MaRDI QIDQ744549FDOQ744549
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
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
- Vandermonde matrices, NP-completeness and transversal subspaces
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- 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.
- Pencils on an Algebraic Variety and a New Proof of a Theorem of Bertini
Cited In (5)
- Counting irreducible components of complex algebraic varieties
- A deterministic polynomial-time algorithm for the first Bertini theorem. III
- Inequalities for Hilbert functions and primary decompositions
- 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
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)
