"Solving satisfiability in less than 2ⁿ steps."

Burkhard Monien, Ewald Speckenmeyer (1985)

> Home

Details and statistics

DOI: 10.1016/0166-218X(85)90050-2

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/MonienS85
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/MonienS85
Burkhard Monien, Ewald Speckenmeyer:
Solving satisfiability in less than 2ⁿ steps. Discret. Appl. Math. 10(3): 287-295 (1985)

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.