Pages that link to "Item:Q1201334"
From MaRDI portal
The following pages link to NC algorithms for real algebraic numbers (Q1201334):
Displaying 9 items.
- Complexity of computation on real algebraic numbers (Q757065) (← links)
- An NC algorithm for Brooks' theorem (Q1124351) (← links)
- Two \(P\)-complete problems in the theory of the reals (Q1203649) (← links)
- Specified precision polynomial root isolation is in NC (Q1329153) (← links)
- On the complexity of quadratic programming in real number models of computation (Q1338219) (← links)
- Towards faster real algebraic numbers (Q1878487) (← links)
- Intrinsic complexity estimates in polynomial optimization (Q2251913) (← links)
- Algorithms – ESA 2004 (Q5464622) (← links)
- Zero counting for a class of univariate Pfaffian functions (Q5964515) (← links)