Accelerating Fourier-Motzkin elimination using bit pattern trees (Q5865333)
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 7540583
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Accelerating Fourier-Motzkin elimination using bit pattern trees |
scientific article; zbMATH DE number 7540583 |
Statements
Accelerating Fourier–Motzkin elimination using bit pattern trees (English)
0 references
13 June 2022
0 references
convex polyhedra
0 references
system of linear inequalities
0 references
variable elimination
0 references
Fourier-Motzkin elimination
0 references
Chernikov rules
0 references
bit pattern tree
0 references
0 references
0 references
0.8229542374610901
0 references
0.7564972639083862
0 references
0.7309532761573792
0 references
0.7249416708946228
0 references
