DSpace Repository

Browsing Mathematics and Computer Science Faculty Research by Subject "Clausal graphs"

Browsing Mathematics and Computer Science Faculty Research by Subject "Clausal graphs"

Sort by: Order: Results:

  • Anthony, Barbara M.; Denman, Richard (2009)
    The not all equal (NAE) 3-SAT problem is known to be NP-complete even in the absence of negated variables (see [11]), a variant known as positive (or monotone) NAE 3-SAT. In this article, we investigate a related category, ...
  • Denman, Richard; Foster, Stephen (2008)
    The 1-in-3 SAT problem is known to be NP-complete even in the absence of negated variables [1], a variant known as Positive (or Monotone) 1-in-3 SAT. In this note, we use clausal graphs to investigate a further restriction: ...

Search


Browse

My Account

Links