Approximating linear programming is log-space complete for P (Q750289): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(91)90194-m / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2029091075 / rank | |||
Normal rank | |||
Latest revision as of 10:34, 30 July 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
