Polynomial-time computation of the degree of algebraic varieties in zero characteristic and its applications.

DOI10.1023/A:1013527102517zbMATH Open1081.14527OpenAlexW1510177106MaRDI QIDQ5959706FDOQ5959706

A. L. Chistov

Publication date: 14 April 2002

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

Full work available at URL: https://doi.org/10.1023/a:1013527102517

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Real algebraic sets (14P05) Computational aspects of higher-dimensional varieties (14Q15)

Cited In (7)

• Title not available (Why is that?)
• On a generalization of Stickelberger's theorem
• Monodromy and irreducibility criteria with algorithmic applications in characteristic zero
• A deterministic polynomial-time algorithm for the first Bertini theorem. III
• The isomorphism problem of projective schemes and related algorithmic problems
• A deterministic polynomial-time algorithm for the first Bertini theorem. I
• Polynomial-time algorithms for a new model of representation of algebraic varieties (in characteristic zero)

This page was built for publication: Polynomial-time computation of the degree of algebraic varieties in zero characteristic and its applications.

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