Solving linear programs without breaking abstractions (Q3177754)
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 6912563
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving linear programs without breaking abstractions |
scientific article; zbMATH DE number 6912563 |
Statements
Solving Linear Programs without Breaking Abstractions (English)
0 references
2 August 2018
0 references
linear programming
0 references
choiceless polynomial time
0 references
ellipsoid method
0 references
fixed-point logic with counting
0 references
maximum matching
0 references
0.8822457194328308
0 references
0.7892293930053711
0 references
0.7738221287727356
0 references
0.7547821998596191
0 references
0.7507306337356567
0 references
