Near-Linear Query Complexity for Graph Inference (Q3448836)

From MaRDI portal
Revision as of 16:45, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Near-Linear Query Complexity for Graph Inference
scientific article

    Statements

    title
    Near-Linear Query Complexity for Graph Inference (English)
    0 references
    author
    Sampath Kannan
    0 references
    Claire Mathieu
    0 references
    Hang Zhou
    0 references
    publication date
    27 October 2015
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    68P20
    0 references
    68R10
    0 references
    68W20
    0 references
    zbMATH DE Number
    6498690
    0 references
    OpenAlex ID
    W1607651383
    0 references
    arXiv ID
    1402.4037
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3448836&oldid=33622750"
    Powered by MediaWiki