Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"The Inapproximability of Non NP-hard Optimization Problems."

Liming Cai, David W. Juedes, Iyad A. Kanj (1998)

> Home

Details and statistics

DOI: 10.1007/3-540-49381-6_46

access: closed

type: Conference or Workshop Paper

metadata version: 2023-06-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/isaac/CaiJK98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/CaiJK98
Liming Cai, David W. Juedes, Iyad A. Kanj:
The Inapproximability of Non NP-hard Optimization Problems. ISAAC 1998: 437-446

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.