A faster algorithm for determining the linear feasibility of systems of BTVPI constraints (Q6169536)
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 faster algorithm for determining the linear feasibility of systems of BTVPI constraints |
scientific article; zbMATH DE number 7726612
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A faster algorithm for determining the linear feasibility of systems of BTVPI constraints |
scientific article; zbMATH DE number 7726612 |
Statements
A faster algorithm for determining the linear feasibility of systems of BTVPI constraints (English)
0 references
14 August 2023
0 references
0 references
0 references
0 references
0.7815727591514587
0 references
0.7790632247924805
0 references
0.7656782269477844
0 references
0.7634122371673584
0 references
0.7593809366226196
0 references
