Pages that link to "Item:Q2917350"
From MaRDI portal
The following pages link to Real computation with least discrete advice: a complexity theory of nonuniform computability (Q2917350):
Displaying 4 items.
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra (Q424551) (← links)
- Computability in linear algebra (Q703545) (← links)
- Recent advances in real complexity and computation. UIMP-RSME Lluís Santaló summer school, Universidad Internacional Menéndez Pelayo, Santander, Spain, July 16--20, 2012 (Q2872513) (← links)
- A Theory of NP-completeness and Ill-conditioning for Approximate Real Computations (Q5215456) (← links)