The following pages link to (Q3765758):
Displaying 12 items.
- On the complexity of online computations of real functions (Q1186506) (← links)
- A refined model of computation for continuous problems (Q1265141) (← links)
- Feasible real random access machines (Q1279912) (← links)
- Online computations of differentiable functions (Q1292412) (← links)
- Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval (Q1589441) (← links)
- Computability on computable metric spaces (Q1802069) (← links)
- Using PVS to validate the algorithms of an exact arithmetic. (Q1853641) (← links)
- Polynomial time over the reals with parsimony (Q2039933) (← links)
- Type 2 computational complexity of functions on Cantor's space (Q2277260) (← links)
- Real Numbers and BDDs (Q4916190) (← links)
- Computability of Real Numbers (Q5024567) (← links)
- The ksmt calculus is a \(\delta \)-complete decision procedure for non-linear constraints (Q6076350) (← links)
