Compact normal forms in propositional logic and integer programming formulations (Q910335)
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 4139487
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Compact normal forms in propositional logic and integer programming formulations |
scientific article; zbMATH DE number 4139487 |
Statements
Compact normal forms in propositional logic and integer programming formulations (English)
0 references
1990
0 references
linear time algorithm
0 references
satisfiability problems
0 references
propositional logic
0 references
branch and bound
0 references
0 references
0.819157600402832
0 references
0.806997537612915
0 references
0.7997609972953796
0 references
0.775142252445221
0 references
0.7578939199447632
0 references
