Quantum complexity for vector domination problem (Q6169538): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5092465 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Speedups for Exponential-Time Dynamic Programming Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Algorithms for the Subset-Sum Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4460858 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111351 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3191147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential-time quantum algorithms for graph coloring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The String-to-String Correction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for optimal 2-constraint satisfaction and its implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank

Latest revision as of 14:11, 2 August 2024

scientific article; zbMATH DE number 7726613
Language Label Description Also known as
English
Quantum complexity for vector domination problem
scientific article; zbMATH DE number 7726613

    Statements

    Quantum complexity for vector domination problem (English)
    0 references
    0 references
    0 references
    14 August 2023
    0 references
    quantum query
    0 references
    quantum query complexity
    0 references
    LWS
    0 references
    element distinctness
    0 references
    QSETH
    0 references
    Fenwick trees
    0 references

    Identifiers