"Polynomially Bounded Minimization Problems That Are Hard to Approximate."

Viggo Kann (1994)

> Home

Details and statistics

DOI: —

access: unavailable

type: Journal Article

metadata version: 2004-01-14

- no documents available
- export record
  dblp key:
  - journals/njc/Kann94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/njc/Kann94
Viggo Kann:
Polynomially Bounded Minimization Problems That Are Hard to Approximate. Nord. J. Comput. 1(3): 317-331 (1994)

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.