Pages that link to "Item:Q1358904"
From MaRDI portal
The following pages link to Polynomial-time computation of the dimensions of components of algebraic varieties in zero-characteristic (Q1358904):
Displaying 14 items.
- Polynomial-time algorithms for a new model of representation of algebraic varieties (in characteristic zero) (Q389092) (← links)
- On a generalization of Stickelberger's theorem (Q607067) (← links)
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers (Q652454) (← links)
- A deterministic polynomial-time algorithm for the first Bertini theorem. I (Q744549) (← links)
- A deterministic polynomial-time algorithm for the first Bertini theorem. III (Q748510) (← links)
- Combinatorial dimension theory of algebraic varieties (Q911659) (← links)
- Polynomial-time computation of the degree of a dominant morphism in zero characteristic. IV. (Q1037007) (← links)
- Complexity of computing the local dimension of a semialgebraic set (Q1300630) (← links)
- Straight-line programs in geometric elimination theory (Q1380007) (← links)
- Solving degenerate sparse polynomial systems faster (Q1808666) (← links)
- The complexity of local dimensions for constructible sets (Q1977150) (← links)
- A deterministic polynomial-time algorithm for the first Bertini theorem. II (Q2256657) (← links)
- Monodromy and irreducibility criteria with algorithmic applications in characteristic zero (Q2577581) (← links)
- (Q5460918) (← links)
