On the parametrized complexity of read-once refutations in UTVPI+ constraint systems (Q2049975)
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 7387689
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the parametrized complexity of read-once refutations in UTVPI+ constraint systems |
scientific article; zbMATH DE number 7387689 |
Statements
On the parametrized complexity of Read-once refutations in UTVPI+ constraint systems (English)
0 references
27 August 2021
0 references
unit two variable per inequality constraints
0 references
network flows
0 references
branching
0 references
parameterized complexity
0 references
strong exponential time hypothesis
0 references
read-once refutation
0 references
0 references
0 references
0 references
0.8730285167694092
0 references
0.8032982349395752
0 references
0.7987233400344849
0 references
0.7621235847473145
0 references
0.7565076351165771
0 references
