Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"On the Computational Complexity of Best L₁-approximation."

Paulo Oliva (2002)

> Home

Details and statistics

DOI: 10.1002/1521-3870(200210)48:1%2B<66::AID-MALQ66>3.0.CO;2-Y

access: closed

type: Journal Article

metadata version: 2018-07-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mlq/Oliva02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mlq/Oliva02
Paulo Oliva:
On the Computational Complexity of Best L₁-approximation. Math. Log. Q. 48(S1): 66-77 (2002)

a service of

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.