Minimum Circuit Size, Graph Isomorphism, and Related Problems (Q4993283)

From MaRDI portal
Revision as of 11:25, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7359357
Language Label Description Also known as
English
Minimum Circuit Size, Graph Isomorphism, and Related Problems
scientific article; zbMATH DE number 7359357

    Statements

    author
    Joshua A. Grochow
    0 references
    Dieter van Melkebeek
    0 references
    Moore, Cristopher
    0 references
    Andrew Morgan
    0 references
    Eric W. Allender
    0 references
    publication date
    15 June 2021
    0 references
    zbMATH Keywords
    reductions between NP-intermediate problems
    0 references
    graph isomorphism
    0 references
    minimum circuit size problem
    0 references
    time-bounded Kolmogorov complexity
    0 references
    title
    Minimum Circuit Size, Graph Isomorphism, and Related Problems (English)
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q10
    0 references
    05C25
    0 references
    05C60
    0 references
    68P30
    0 references
    68Q06
    0 references
    68Q17
    0 references
    68Q25
    0 references
    68Q30
    0 references
    68R10
    0 references
    zbMATH DE Number
    7359357
    0 references
    OpenAlex ID
    W2963858417
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4993283&oldid=37276391"
    Powered by MediaWiki