Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Max NP-completeness Made Easy."

Pierluigi Crescenzi, Luca Trevisan (1999)

> Home

Details and statistics

DOI: 10.1016/S0304-3975(98)00200-X

access: open

type: Journal Article

metadata version: 2023-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/CrescenziT99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/CrescenziT99
Pierluigi Crescenzi, Luca Trevisan:
Max NP-completeness Made Easy. Theor. Comput. Sci. 225(1-2): 65-79 (1999)

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.