"A Computational Study of Satisfiability Algorithms for Propositional Logic."

Farid Harche, John N. Hooker, Gerald L. Thompson (1994)

> Home

Details and statistics

DOI: 10.1287/IJOC.6.4.423

access: closed

type: Journal Article

metadata version: 2020-03-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/informs/HarcheHT94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/informs/HarcheHT94
Farid Harche, John N. Hooker, Gerald L. Thompson:
A Computational Study of Satisfiability Algorithms for Propositional Logic. INFORMS J. Comput. 6(4): 423-435 (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.