Generating Random SAT Instances: Multiple Solutions could be Predefined and Deeply Hidden (Q5881807)
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 7662472
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generating Random SAT Instances: Multiple Solutions could be Predefined and Deeply Hidden |
scientific article; zbMATH DE number 7662472 |
Statements
Generating Random SAT Instances: Multiple Solutions could be Predefined and Deeply Hidden (English)
0 references
13 March 2023
0 references
probabilistic reasoning
0 references
satisfiability
0 references
constraint programming
0 references
0.7417489886283875
0 references
0.7406139969825745
0 references
0.7380244731903076
0 references
0.7293663620948792
0 references
