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

From MaRDI portal
Revision as of 19:22, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
The maximum flow problem is log space complete for P
scientific article

    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