Pages that link to "Item:Q4713865"
From MaRDI portal
The following pages link to Sur la complexité du principe de Tarski-Seidenberg (Q4713865):
Displaying 5 items.
- Metric properties of semialgebraic mappings (Q309643) (← links)
- \(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\) (Q1201156) (← links)
- Complexity lower bounds for computation trees with elementary transcendental function gates (Q1365876) (← links)
- Real computations with fake numbers (Q1599196) (← links)
- Learning from rounded-off data. (Q1873753) (← links)
