Q5002674 (Q5002674): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1804.08978 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subtree Isomorphism Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consequences of Faster Alignment of Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching Triangles and Basing Hardness on an Extremely Popular Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: More Applications of the Polynomial Method to Algorithm Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Discrete Fréchet Distance in Subquadratic Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bit-string longest-common-subsequence algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Can we compute the similarity between surfaces? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of distance measures for planar curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for obtaining more than quadratic effective lower estimates of complexity of \(\pi\) schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5616735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fréchet Distance for Curves, Revisited / 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: Regularity Lemmas and Combinatorial Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subquadratic algorithms for 3SUM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and compact regular expression matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Regular Expression Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size-depth tradeoffs for Boolean formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: DETECTING COMMUTING PATTERNS BY CLUSTERING SUBTRAJECTORIES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four Soviets Walk the Dog—with an Application to Alt's Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Bounds for Approximating Extremal Distances in Undirected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Satisfiability of Small Depth Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speeding up the Four Russians Algorithm by About One More Logarithmic Factor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability Algorithms and Lower Bounds for Boolean Formulas over Finite Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mining circuit lower bound proofs for meta-algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Deterministic #SAT Algorithm for Small De Morgan Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability on Mixed Instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geodesic Fréchet distance inside a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast and practical bit-vector algorithm for the longest common subsequence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Fréchet distance for realistic curves in near linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035663 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circuit Size Lower Bounds and #SAT Upper Bounds Through a General Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shrinkage Exponent of de Morgan Formulas is 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Time Versus Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The effect of random restrictions on formula size / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate nearest neighbor algorithms for Frechet distance via product metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Method of determining lower bounds for the complexity of \(\Pi\)-circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fréchet distance with speed limits / 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: Subquadratic algorithms for succinct stable matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Four Russians algorithm for regular expression pattern matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shrinkage of de Morgan formulae under restriction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved exponential-time algorithm for <i>k</i> -SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximation algorithms for the diameter and radius of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A satisfiability algorithm and average-case hardness for formulas over the full binary basis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3281059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming Techniques: Regular expression search algorithm / 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: Improving Exhaustive Search Implies Superpolynomial Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4589023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster all-pairs shortest paths via circuit complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonuniform ACC Circuit Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved combinatorial algorithm for Boolean matrix multiplication / rank
 
Normal rank

Latest revision as of 07:42, 26 July 2024

scientific article; zbMATH DE number 7375935
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7375935

    Statements

    0 references
    0 references
    28 July 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    fine-grained complexity
    0 references
    hardness in P
    0 references
    Formula-SAT
    0 references
    longest common subsequence
    0 references
    Fréchet distance
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references