A bounded-error quantum polynomial-time algorithm for two graph bisection problems (Q747789)

From MaRDI portal
Revision as of 20:04, 31 December 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/qip/Younes15, #quickstatements; #temporary_batch_1735671842350)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A bounded-error quantum polynomial-time algorithm for two graph bisection problems
scientific article

    Statements

    title
    A bounded-error quantum polynomial-time algorithm for two graph bisection problems (English)
    0 references
    author
    Ahmed Younes
    0 references
    publication date
    19 October 2015
    0 references
    zbMATH Keywords
    quantum algorithm
    0 references
    graph bisection
    0 references
    MAX-bisection
    0 references
    MIN-bisection
    0 references
    amplitude amplification
    0 references
    BQP
    0 references
    NP-hard
    0 references
    describes a project that uses
    KaFFPa
    0 references
    DibaP
    0 references
    KaHIP
    0 references
    Pregel
    0 references

    Identifiers

    Mathematics Subject Classification ID
    81P68
    0 references
    68Q12
    0 references
    05C51
    0 references
    zbMATH DE Number
    6495839
    0 references
    Wikidata QID
    Q62040672
    0 references
    OpenAlex ID
    W3121505928
    0 references
    arXiv ID
    1505.06284
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q747789&oldid=39802385"
    Powered by MediaWiki