Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems (Q2701384): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3093792486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster algorithm computing string edit distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious string embeddings and edit distance approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest common substring made fully dynamic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear Space Algorithms for the Longest Common Substring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edit Distance Cannot Be Computed in Strongly Subquadratic Time (Unless SETH is False) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Walk Algorithm for Element Distinctness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum verification of matrix products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Algorithms for the Triangle Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: String matching in \(\tilde O(\sqrt n+\sqrt m)\) quantum time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing Strings from Substrings with Quantum Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3410550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant factor approximations to edit distance on far input pairs in nearly linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-factor approximation of near-linear edit distance in near-linear time / 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: Q5092465 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the length of longest increasing subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Ω(<i>n</i>lg<i>n</i>) lower bound for finding a longest increasing subsequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accurate and Nearly Optimal Sublinear Approximations to Ulam Distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4819589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002773 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic algorithms for LIS and distance to monotonicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search via Quantum Walk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the Longest Increasing Sequence in Polylogarithmic Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration of Measure for the Analysis of Randomized Algorithms / 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: Q3002756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Erdős-Rényi law with shifts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengths and Weaknesses of Quantum Computing / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 01:44, 1 August 2024

scientific article
Language Label Description Also known as
English
Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems
scientific article

    Statements

    Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems (English)
    0 references
    0 references
    0 references
    0 references
    28 April 2023
    0 references
    string algorithms
    0 references
    quantum algorithms
    0 references
    sublinear-time algorithms
    0 references
    fine-grained complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers