On the complexity of finding shortest variable disjunction branch-and-bound proofs (Q2164707)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of finding shortest variable disjunction branch-and-bound proofs |
scientific article |
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
