On the complexity of finding shortest variable disjunction branch-and-bound proofs (Q2164707)
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 7572296
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of finding shortest variable disjunction branch-and-bound proofs |
scientific article; zbMATH DE number 7572296 |
Statements
On the complexity of finding shortest variable disjunction branch-and-bound proofs (English)
0 references
16 August 2022
0 references
binary program
0 references
branch-and-bound proof
0 references
counting problem
0 references
0.8127638697624207
0 references
0.7495757937431335
0 references
0.746242880821228
0 references
0.7445657849311829
0 references
0.7396482825279236
0 references
