Approximating linear programming is log-space complete for P (Q750289)

From MaRDI portal
Revision as of 06:08, 5 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    1991
    0 references
    0 references
    0 references
    0 references
    0 references
    approximations
    0 references
    P-complete under log-space reductions
    0 references
    Boolean circuit
    0 references