Pages that link to "Item:Q2577581"

The following pages link to Monodromy and irreducibility criteria with algorithmic applications in characteristic zero (Q2577581):

Displaying 9 items.

• Polynomial-time algorithms for a new model of representation of algebraic varieties (in characteristic zero) (Q389092) (← links)
• Polynomial-time computation of the dimension of algebraic varieties in zero-characteristic (Q677033) (← 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)
• Polynomial-time computation of the degree of a dominant morphism in zero characteristic. IV. (Q1037007) (← links)
• Complex dynamics in generalized Hénon map (Q1723257) (← links)
• A deterministic polynomial-time algorithm for the first Bertini theorem. II (Q2256657) (← links)
• Effective construction of local parameters of irreducible components of an algebraic variety. (Q2764198) (← links)
• The isomorphism problem of projective schemes and related algorithmic problems (Q6116696) (← links)