The maximum flow problem is log space complete for P (Q1165000)

From MaRDI portal
Revision as of 02:40, 16 July 2025 by CorrectionBot (talk | contribs) (‎Changed label, description and/or aliases in en, and other parts)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article; zbMATH DE number 3765135
Language Label Description Also known as
English
The maximum flow problem is log space complete for P
scientific article; zbMATH DE number 3765135

    Statements

    The maximum flow problem is log space complete for P (English)
    0 references
    0 references
    0 references
    0 references
    1982
    0 references
    space complexity
    0 references
    deterministic polynomial time
    0 references

    Identifiers