Approximating linear programming is log-space complete for P (Q750289): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:24, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating linear programming is log-space complete for P |
scientific article |
Statements
Approximating linear programming is log-space complete for P (English)
0 references
1991
0 references
approximations
0 references
P-complete under log-space reductions
0 references
Boolean circuit
0 references
