"The satisfiability problem in regular CNF-formulas."

Felip Manyà, Ramón Béjar, Gonzalo Escalada-Imaz (1998)

> Home

Details and statistics

DOI: 10.1007/S005000050042

access: closed

type: Journal Article

metadata version: 2017-05-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/soco/ManyaBE98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/soco/ManyaBE98
Felip Manyà, Ramón Béjar, Gonzalo Escalada-Imaz:
The satisfiability problem in regular CNF-formulas. Soft Comput. 2(3): 116-123 (1998)

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.