A complexity perspective on entailment of parameterized linear constraints (Q487646)
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 complexity perspective on entailment of parameterized linear constraints |
scientific article; zbMATH DE number 6389804
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A complexity perspective on entailment of parameterized linear constraints |
scientific article; zbMATH DE number 6389804 |
Statements
A complexity perspective on entailment of parameterized linear constraints (English)
0 references
22 January 2015
0 references
entailment
0 references
parameterized linear constraint
0 references
quantified linear program
0 references
quantified linear implication
0 references
computational complexity
0 references
polynomial algorithm
0 references
0 references
0 references
0.716690719127655
0 references
0.7158903479576111
0 references
0.7151068449020386
0 references
0.7129202485084534
0 references
0.7109003067016602
0 references
