scientific article; zbMATH DE number 3825797
From MaRDI portal
Publication:3671969
Cited in
(8)- An application of proof mining to nonlinear iterations
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
- Some logical metatheorems with applications in functional analysis
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
- Computer Science for Continuous Data
- Presenting intuitive deductions via symmetric simplification
- Natural constructive proofs of A via A B, proof paradoxes, and impredicativity
- A continuous, constructive solution to Hilbert's \(17^{th}\) problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3671969)