A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints (Q2415363)
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: A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints |
scientific article |
Statements
A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints (English)
0 references
21 May 2019
0 references
read-once refutation
0 references
UTVPI constraints
0 references
difference constraints
0 references
literal-once refutation
0 references
NP-hard
0 references
