„3Sum problem“

Suchergebnisse

9 Treffer

• Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets
  Aronov, Boris ; Ezra, Esther ; Šārîr, Mîkā 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model
  Aronov, Boris ; de Berg, Mark ; Cardinal, Jean ; Ezra, Esther ; Iacono, John ; Šārîr, Mîkā 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Cryptanalysis of a Generalized Subset-Sum Pseudorandom Generator
  Bouillaguet, Charles ; Martinez, Florette ; Vergnaud, Damien 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Limits of Quantum Speed-Ups for Computational Geometry and Other Problems: Fine-Grained Complexity via Quantum Walks
  Buhrman, Harry ; Loff, Bruno ; Patro, Subhasree ; Speelman, Florian 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Hardness of Detecting Abelian and Additive Square Factors in Strings
  Radoszewski, Jakub ; Rytter, Wojciech ; Straszyński, Juliusz ; Waleń, Tomasz ; Zuba, Wiktor 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• 3SUM and Related Problems in Fine-Grained Complexity (Invited Talk)
  Vassilevska Williams, Virginia 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Quantum Algorithms for Computational Geometry Problems
  Ambainis, Andris ; Larka, Nikita 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk)
  Vassilevska Williams, Virginia 2015 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Improved Subquadratic 3SUM
  Freund, Ari