"Finding Compact Scheme Forests in Nested Normal Form is NP-Hard"

Peter Thanisch, George Loizou, Jyrki Nummenmaa (1994)

> Home

Details and statistics

DOI: 10.1006/INCO.1994.1022

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/iandc/ThanischLN94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/ThanischLN94
Peter Thanisch, George Loizou, Jyrki Nummenmaa:
Finding Compact Scheme Forests in Nested Normal Form is NP-Hard. Inf. Comput. 110(1): 19-41 (1994)

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.