"The k-Satisfiability problem remains NP-complete for dense families."

Ingo Schiermeyer (1994)

> Home

Details and statistics

DOI: 10.1016/0012-365X(94)90175-9

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dm/Schiermeyer94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/Schiermeyer94
Ingo Schiermeyer:
The k-Satisfiability problem remains NP-complete for dense families. Discret. Math. 125(1-3): 343-346 (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.