Pages that link to "Item:Q1821775"
From MaRDI portal
The following pages link to On the computational complexity of best Chebyshev approximations (Q1821775):
Displaying 8 items.
- Effective moduli from ineffective uniqueness proofs. An unwinding of de La Vallée Poussin's proof for Chebycheff approximation (Q688431) (← links)
- Approximation to measurable functions and its relation to probabilistic computation (Q1088659) (← links)
- Using a computer to obtain Chebotarev bounds in the nonhomogeneous Minkowski's conjecture (Q1114752) (← links)
- Proof mining in \(L_{1}\)-approximation (Q1874241) (← links)
- In Memoriam: Ker-I Ko (1950–2018) (Q3297820) (← links)
- New effective moduli of uniqueness and uniform a priori estimates for constants of strong unicity by logical analysis of known proofs in best approximation theory (Q4293278) (← links)
- On the Computational Complexity of Best L1-approximation (Q4787858) (← links)
- Chebyshev's approximation algorithms and applications (Q5948720) (← links)