"On the Hardness of Approximating Some Optimization Problems That Are ..."

Oleg Verbitsky (1995)

> Home

Details and statistics

DOI: 10.1017/S0963548300001553

access: closed

type: Journal Article

metadata version: 2022-10-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cpc/Verbitsky95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cpc/Verbitsky95
Oleg Verbitsky:
On the Hardness of Approximating Some Optimization Problems That Are Supposedly Easier Than MAX CLIQUE. Comb. Probab. Comput. 4: 167-180 (1995)

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.