"A Machine Model for the Complexity of NP-Approximation Problems."

Richard Chang (2001)

> Home

Details and statistics

DOI: —

access: unavailable

type: Part in Book or Collection

metadata version: 2021-12-14

- no documents available
- export record
  dblp key:
  - books/ws/phaunRS01/Chang01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/books/ws/phaunRS01/Chang01
Richard Chang:
A Machine Model for the Complexity of NP-Approximation Problems. Current Trends in Theoretical Computer Science 2001: 4-24

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.