Approximating linear programming is log-space complete for P (Q750289): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A taxonomy of problems with fast parallel algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear programming is log-space hard for P / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of linear programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new polynomial-time algorithm for linear programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4197641 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3796746 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4051879 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3484351 / rank | |||
Normal rank | |||
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