"Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard ..."

Douglas Bauer et al. (2002)

> Home

Details and statistics

DOI: 10.1016/S0166-218X(01)00276-1

access: open

type: Journal Article

metadata version: 2024-10-06

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/BauerBMS02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/BauerBMS02
Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel:
Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion. Discret. Appl. Math. 120(1-3): 13-23 (2002)

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.