Pages that link to "Item:Q1874241"
From MaRDI portal
The following pages link to Proof mining in \(L_{1}\)-approximation (Q1874241):
Displaying 15 items.
- Effective moduli from ineffective uniqueness proofs. An unwinding of de La Vallée Poussin's proof for Chebycheff approximation (Q688431) (← links)
- Moduli of regularity and rates of convergence for Fejér monotone sequences (Q2317680) (← links)
- Fundamental notions of analysis in subsystems of second-order arithmetic (Q2368910) (← links)
- An application of proof mining to nonlinear iterations (Q2453072) (← links)
- Bounded functional interpretation (Q2488269) (← links)
- Minimum propositional proof length is NP-hard to linearly approximate (Q2732273) (← links)
- (Q3079693) (← links)
- 2003 Annual Meeting of the Association for Symbolic Logic (Q4678936) (← links)
- On the Computational Complexity of Best L1-approximation (Q4787858) (← links)
- Some logical metatheorems with applications in functional analysis (Q4819747) (← links)
- PROOF MINING IN <i>L</i><sup><i>p</i></sup> SPACES (Q5207569) (← links)
- (Q5219931) (← links)
- 2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09 (Q5305554) (← links)
- Bounds on strong unicity for Chebyshev approximation with bounded coefficients (Q6094024) (← links)
- BLOOM: bimodal lattice one-out-of-many proofs and applications (Q6133965) (← links)