A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints (Q2415363): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q696998 |
Changed an Item |
||
| Property / author | |||
| Property / author: K. Subramani and Vahan Mkrtchyan / rank | |||
Normal rank | |||
Revision as of 14:05, 20 February 2024
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
