Revision history of "Using clausal graphs to determine the computational complexity of \(k\)-bounded positive one-in-three SAT" (Q1028148)
From MaRDI portal
Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.