On the power of non-adaptive learning graphs (Q488054): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1210.3279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum lower bounds for the collision and the element distinctness problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum lower bounds by quantum arguments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Walk Algorithm for Element Distinctness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Span programs for functions with constant-sized 1-certificates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum algorithms for learning symmetric juntas via the adversary bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adversary lower bound for the k-sum problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum cryptanalysis of hash and claw-free functions / 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: Q3522560 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quantum query complexity of the hidden subgroup problem is polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal arrays. Theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5414605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Query Complexity of State Conversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved quantum query algorithms for triangle detection and associativity testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Algorithms for the Triangle Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search via Quantum Walk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002763 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5393666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of Ambainis lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: QUANTUM QUERY COMPLEXITY OF CONSTANT-SIZED SUBGRAPH CONTAINMENT / rank
 
Normal rank

Latest revision as of 14:07, 9 July 2024

scientific article
Language Label Description Also known as
English
On the power of non-adaptive learning graphs
scientific article

    Statements

    On the power of non-adaptive learning graphs (English)
    0 references
    0 references
    0 references
    23 January 2015
    0 references
    0 references
    quantum computing
    0 references
    query algorithms
    0 references
    adversary method
    0 references
    \(k\)-sum problem
    0 references
    triangle problem
    0 references
    semidefinite optimization
    0 references
    0 references
    0 references