"Maximum Bounded 3-Dimensional Matching is MAX SNP-Complete."

Viggo Kann (1991)

> Home

Details and statistics

DOI: 10.1016/0020-0190(91)90246-E

access: closed

type: Journal Article

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/Kann91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/Kann91
Viggo Kann:
Maximum Bounded 3-Dimensional Matching is MAX SNP-Complete. Inf. Process. Lett. 37(1): 27-35 (1991)

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.