Exact satisfiability of linear CNF formulas (Q1627839): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: XSAT and NAE-SAT of linear CNF classes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Note on a Combinatorial Problem / rank | |||
Normal rank | |||
Revision as of 12:53, 17 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exact satisfiability of linear CNF formulas |
scientific article |
Statements
Exact satisfiability of linear CNF formulas (English)
0 references
3 December 2018
0 references
complexity
0 references
XSAT
0 references
exact linear formula
0 references
\(l\)-regularity
0 references
\(k\)-uniformity
0 references
NP-completeness
0 references
