Pages that link to "Item:Q1037007"
From MaRDI portal
The following pages link to Polynomial-time computation of the degree of a dominant morphism in zero characteristic. IV. (Q1037007):
Displaying 4 items.
- 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)
- A deterministic polynomial-time algorithm for the first Bertini theorem. II (Q2256657) (← links)
- The isomorphism problem of projective schemes and related algorithmic problems (Q6116696) (← links)