Pages that link to "Item:Q684961"
From MaRDI portal
The following pages link to Polynomial complexity algorithms for computational problems in the theory of algebraic curves (Q684961):
Displaying 8 items.
- Algorithmic problems for differential polynomial algebras (Q267385) (← links)
- A polynomial-time algorithm for the topological type of real algebraic curve - extended abstract (Q1070298) (← links)
- A polynomial-time algorithm for the topological type of real algebraic curve (Q1115496) (← links)
- Fine costs for Euclid's algorithm on polynomials and Farey maps (Q2439896) (← links)
- (Q3373045) (← links)
- A Polynomial Time Complexity Bound for Computations on Curves (Q4210172) (← links)
- (Q4252451) (← links)
- (Q5494787) (← links)