Using clausal graphs to determine the computational complexity of \(k\)-bounded positive one-in-three SAT (Q1028148): Difference between revisions

@@ Property / author @@
-Richard T. Denman
@@ Property / author: Richard T. Denman / rank @@
-Normal rank
@@ Property / author @@
+Richard T. Denman
@@ Property / author: Richard T. Denman / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2008.09.011
+Normal rank
@@ Property / OpenAlex ID @@
+W2100367658
@@ Property / OpenAlex ID: W2100367658 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+A simplified NP-complete satisfiability problem
@@ Property / cites work: A simplified NP-complete satisfiability problem / rank @@
+Normal rank
@@ Property / cites work @@
+Computational complexity of some restricted instances of 3-SAT
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+TWO THEOREMS IN GRAPH THEORY
@@ Property / cites work: TWO THEOREMS IN GRAPH THEORY / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1028148