"Recognizing Renamable Generalized Propositional Horn Formulas Is NP-complete."

Thomas Eiter, Pekka Kilpeläinen, Heikki Mannila (1995)

> Home

Details and statistics

DOI: 10.1016/0166-218X(93)E0152-O

access: open

type: Journal Article

metadata version: 2021-02-11

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/EiterKM95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/EiterKM95
Thomas Eiter, Pekka Kilpeläinen, Heikki Mannila:
Recognizing Renamable Generalized Propositional Horn Formulas Is NP-complete. Discret. Appl. Math. 59(1): 23-31 (1995)

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.