Quadratically tight relations for randomized query complexity (Q5915578)

From MaRDI portal
Revision as of 22:57, 21 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7175457
Language Label Description Also known as
English
Quadratically tight relations for randomized query complexity
scientific article; zbMATH DE number 7175457

    Statements

    title
    Quadratically tight relations for randomized query complexity (English)
    0 references
    author
    Rahul Jain
    0 references
    Hartmut Klauck
    0 references
    Srijita Kundu
    0 references
    Troy Lee
    0 references
    Miklos Santha
    0 references
    Swagato Sanyal
    0 references
    Jevgēnijs Vihrovs
    0 references
    publication date
    28 November 2018
    0 references
    27 February 2020
    0 references
    zbMATH Keywords
    query complexity
    0 references
    randomized algorithms
    0 references
    certificate complexity
    0 references
    fractional block sensitivity
    0 references
    corruption bound
    0 references

    Identifiers

    zbMATH Open document ID
    1434.68198
    0 references
    1434.68199
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    68Q04
    0 references
    68W20
    0 references
    zbMATH DE Number
    6986119
    0 references
    7175457
    0 references
    Wikidata QID
    Q58040173
    0 references
    OpenAlex ID
    W2741419985
    0 references
    W2967218436
    0 references
    arXiv ID
    1708.00822
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5915578&oldid=36566243"
    Powered by MediaWiki