Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Using clausal graphs to determine the computational complexity of ..."

Richard Denman, Stephen Foster (2009)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2008.09.011

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/DenmanF09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/DenmanF09
Richard Denman, Stephen Foster:
Using clausal graphs to determine the computational complexity of k-bounded positive one-in-three SAT. Discret. Appl. Math. 157(7): 1655-1659 (2009)

a service of

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.