On black-box optimization in divide-and-conquer SAT solving (Q5085259)
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 black-box optimization in divide-and-conquer SAT solving |
scientific article; zbMATH DE number 7548201
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On black-box optimization in divide-and-conquer SAT solving |
scientific article; zbMATH DE number 7548201 |
Statements
On black-box optimization in divide-and-conquer SAT solving (English)
0 references
27 June 2022
0 references
pseudo-Boolean optimization
0 references
black-box optimization
0 references
Monte-Carlo method
0 references
SAT
0 references
divide-and-conquer
0 references
cryptanalysis
0 references
0 references
0 references
0.9307471513748168
0 references
0.7546502947807312
0 references
0.7415141463279724
0 references
0.7405042052268982
0 references
0.7405042052268982
0 references
