The robustness of LWPP and WPP, with an application to graph reconstruction (Q2027204)

From MaRDI portal
Revision as of 20:59, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The robustness of LWPP and WPP, with an application to graph reconstruction
scientific article

    Statements

    The robustness of LWPP and WPP, with an application to graph reconstruction (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 May 2021
    0 references
    0 references
    structural complexity theory
    0 references
    robustness of counting classes
    0 references
    legitimate deck problem
    0 references
    PP-lowness
    0 references
    reconstruction conjecture
    0 references
    0 references