Pages that link to "Item:Q2285136"
From MaRDI portal
The following pages link to Parametrised second-order complexity theory with applications to the study of interval computation (Q2285136):
Displaying 5 items.
- Quantitative coding and complexity theory of compact metric spaces (Q2106606) (← links)
- A Shift-free Characterization of NP within Interval-valued Computing (Q4601153) (← links)
- (Q4989411) (← links)
- Quantitative continuity and Computable Analysis in Coq (Q5875440) (← links)
- On the complexity of robust eventual inequality testing for C-finite functions (Q6623018) (← links)