"Finding Type Sets is NP-Hard."

David Hobby (1991)

> Home

Details and statistics

DOI: 10.1142/S0218196791000304

access: closed

type: Journal Article

metadata version: 2020-08-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ijac/Hobby91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijac/Hobby91
David Hobby:
Finding Type Sets is NP-Hard. Int. J. Algebra Comput. 1(4): 437-444 (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.