Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints (Q2235285)
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: Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints |
scientific article; zbMATH DE number 7412193
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints |
scientific article; zbMATH DE number 7412193 |
Statements
Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints (English)
0 references
21 October 2021
0 references
0 references
0 references
0 references
0.9669721126556396
0 references
0.8707085847854614
0 references
0.8656644821166992
0 references
0.8159820437431335
0 references
0.8140384554862976
0 references
