"On the computational complexity of best Chebyshev approximations."

Ker-I Ko (1986)

> Home

Details and statistics

DOI: 10.1016/0885-064X(86)90014-2

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jc/Ko86
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jc/Ko86
Ker-I Ko:
On the computational complexity of best Chebyshev approximations. J. Complex. 2(2): 95-120 (1986)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.