Pages that link to "Item:Q3482745"
From MaRDI portal
The following pages link to Some Remarks on the Foundations of Numerical Analysis (Q3482745):
Displaying 15 items.
- A weak version of the Blum, Shub, and Smale model (Q676432) (← links)
- \(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\) (Q1201156) (← links)
- A refined model of computation for continuous problems (Q1265141) (← links)
- Complexity of Bezout's theorem. V: Polynomial time (Q1338222) (← links)
- Real data-integer solution problems within the Blum-Shub-Smale computational model (Q1368838) (← links)
- On the complexity of linear programming under finite precision arithmetic (Q1380938) (← links)
- A theory of complexity for continuous time systems (Q1599194) (← links)
- Real computations with fake numbers (Q1599196) (← links)
- An alternative to Ben-Or's lower bound for the knapsack problem complexity (Q1609452) (← links)
- Algorithmic analysis of irrational rotations in a single neuron model (Q1869962) (← links)
- On the complexity of solving feasible systems of linear inequalities specified with approximate data (Q1919805) (← links)
- Linear programming, complexity theory and elementary functional analysis (Q1924066) (← links)
- Computable scalar fields: A basis for PDE software (Q2568116) (← links)
- A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF (Q5177339) (← links)
- Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing (Q6182782) (← links)
