Quadratically tight relations for randomized query complexity (Q5915578): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58040173, #quickstatements; #temporary_batch_1704806754709
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
description / endescription / en
scientific article; zbMATH DE number 6986119
scientific article; zbMATH DE number 7175457
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1434.68199 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/s00224-019-09935-x / rank
 
Normal rank
Property / published in
 
Property / published in: Theory of Computing Systems / rank
 
Normal rank
Property / publication date
 
27 February 2020
Timestamp+2020-02-27T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 27 February 2020 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 7175457 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2741419985 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2967218436 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1708.00822 / rank
 
Normal rank
Property / zbMATH Keywords
 
query complexity
Property / zbMATH Keywords: query complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
randomized algorithms
Property / zbMATH Keywords: randomized algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
certificate complexity
Property / zbMATH Keywords: certificate complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
fractional block sensitivity
Property / zbMATH Keywords: fractional block sensitivity / rank
 
Normal rank
Property / zbMATH Keywords
 
corruption bound
Property / zbMATH Keywords: corruption bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum certificate complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separations in query complexity using cheat sheets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5368738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum lower bounds by polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity measures and decision tree complexity: a survey. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Composition limits and separating examples for some Boolean function complexity measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4598278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3187177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties and applications of boolean function composition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query complexity, or why is it difficult to separate \(NP^ A\cap coNP^ A\) from \(P^ A\) by random oracles A? / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:57, 21 July 2024

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

    Quadratically tight relations for randomized query complexity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 November 2018
    0 references
    27 February 2020
    0 references
    query complexity
    0 references
    randomized algorithms
    0 references
    certificate complexity
    0 references
    fractional block sensitivity
    0 references
    corruption bound
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references