Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments (Q3511328)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5299247
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments |
scientific article; zbMATH DE number 5299247 |
Statements
Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments (English)
0 references
10 July 2008
0 references
0.7608275413513184
0 references
0.7583037614822388
0 references
0.7558203935623169
0 references
0.7548436522483826
0 references
0.7435624003410339
0 references
