scientific article; zbMATH DE number 7378707
From MaRDI portal
Publication:5009597
DOI10.4230/LIPIcs.ESA.2018.37MaRDI QIDQ5009597
Isaac Goldstein, Ely Porat, Moshe Lewenstein
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1807.03718
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a class of \(O(n^ 2)\) problems in computational geometry
- Conditional lower bounds for space/time tradeoffs
- Towards polynomial lower bounds for dynamic problems
- Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems
- Space-Efficient Randomized Algorithms for K-SUM
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture
- Improved Generic Algorithms for Hard Knapsacks
- New Generic Algorithms for Hard Knapsacks
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
- Higher Lower Bounds from the 3SUM Conjecture
- Universal hashing and k-wise independent random variables via integer arithmetic without primes
- Faster space-efficient algorithms for subset sum and k-sum
- Reducibility among Combinatorial Problems
- Consequences of Faster Alignment of Sequences
- On Hardness of Jumbled Indexing
- Exact Weight Subgraphs and the k-Sum Conjecture
- Space–Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm
- Algorithms and Data Structures
