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

From MaRDI portal
Merged Item from Q5919457
ReferenceBot (talk | contribs)
Changed an Item
 
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

Latest revision as of 22: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