The Query Complexity of Finding a Hidden Permutation (Q2848962)

From MaRDI portal
Revision as of 21:33, 6 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The Query Complexity of Finding a Hidden Permutation
scientific article

    Statements

    title
    The Query Complexity of Finding a Hidden Permutation (English)
    0 references
    author
    Peyman Afshani
    0 references
    Benjamin Doerr
    0 references
    Carola Doerr
    0 references
    Kasper Green Larsen
    0 references
    Kurt Mehlhorn
    0 references
    Manindra Agrawal
    0 references
    publication date
    13 September 2013
    0 references
    zbMATH DE Number
    6208163
    0 references
    OpenAlex ID
    W1526420097
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2848962&oldid=35351831"
    Powered by MediaWiki