Approximating linear programming is log-space complete for P (Q750289): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:07, 5 March 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
