Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation (Q2870055)

From MaRDI portal
Revision as of 09:21, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation
scientific article

    Statements

    title
    Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation (English)
    0 references
    author
    Mourad El Ouali
    0 references
    Volkmar Sauerland
    0 references
    publication date
    17 January 2014
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68W25
    0 references
    05A05
    0 references
    91A46
    0 references
    zbMATH DE Number
    6247351
    0 references
    OpenAlex ID
    W2168849190
    0 references
    arXiv ID
    1303.5862
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2870055&oldid=33563630"
    Powered by MediaWiki