A lower bound on CNF encodings of the at-most-one constraint (Q5915765)
From MaRDI portal
(Redirected from Item:Q5915959)
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A lower bound on CNF encodings of the at-most-one constraint |
scientific article; zbMATH DE number 7030857
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound on CNF encodings of the at-most-one constraint |
scientific article; zbMATH DE number 7030857 |
Statements
A lower bound on CNF encodings of the at-most-one constraint (English)
0 references
15 November 2017
0 references
28 February 2019
0 references
knowledge compilation
0 references
cardinality constraint
0 references
at most one constraint
0 references
propagation-complete encoding
0 references
propagation complete encoding
0 references
0 references
0.9973849058151244
0 references
0.7936332821846008
0 references