On propositional coding techniques for the distinguishability of objects in finite sets (Q2272883)
From MaRDI portal
 | 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: On propositional coding techniques for the distinguishability of objects in finite sets |
scientific article; zbMATH DE number 7105750
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On propositional coding techniques for the distinguishability of objects in finite sets |
scientific article; zbMATH DE number 7105750 |
Statements
On propositional coding techniques for the distinguishability of objects in finite sets (English)
0 references
17 September 2019
0 references
propositional encoding
0 references
Boolean satisfiability problem (SAT)
0 references
Latin squares
0 references
0 references
0.84461737
0 references
0.84461737
0 references
0.83403015
0 references
0.8300676
0 references
0.8249175
0 references
0.8198223
0 references
0.80904377
0 references
0.8079159
0 references
