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

From MaRDI portal
Revision as of 03:59, 15 September 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q129516864, #quickstatements; #temporary_batch_1726365119168)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Minimum Circuit Size, Graph Isomorphism, and Related Problems
scientific article

    Statements

    title
    Minimum Circuit Size, Graph Isomorphism, and Related Problems (English)
    0 references
    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
    19 July 2018
    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
    cites work
    Q5111269
    0 references
    Q3334986
    0 references
    Q4941874
    0 references
    Q5111137
    0 references
    Q5368752
    0 references
    Q4650358
    0 references
    Q4057549
    0 references
    Q4273947
    0 references
    Q5368903
    0 references
    Hardness vs randomness
    0 references
    Q5111148
    0 references
    Q4787523
    0 references

    Identifiers

    DOI
    10.1137/17M1157970
    0 references
    Mathematics Subject Classification ID
    68Q15
    0 references
    05C60
    0 references
    68Q17
    0 references
    68Q30
    0 references
    zbMATH DE Number
    6908308
    0 references
    arXiv ID
    1710.09806
    0 references
    OpenAlex ID
    W2884885487
    0 references
    Wikidata QID
    Q129516864
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3176189&oldid=37844010"
    Powered by MediaWiki