5 research outputs found
On the Hardness of Set Disjointness and Set Intersection with Bounded Universe
In the SetDisjointness problem, a collection of m sets S_1,S_2,...,S_m from some universe U is preprocessed in order to answer queries on the emptiness of the intersection of some two query sets from the collection. In the SetIntersection variant, all the elements in the intersection of the query sets are required to be reported. These are two fundamental problems that were considered in several papers from both the upper bound and lower bound perspective.
Several conditional lower bounds for these problems were proven for the tradeoff between preprocessing and query time or the tradeoff between space and query time. Moreover, there are several unconditional hardness results for these problems in some specific computational models. The fundamental nature of the SetDisjointness and SetIntersection problems makes them useful for proving the conditional hardness of other problems from various areas. However, the universe of the elements in the sets may be very large, which may cause the reduction to some other problems to be inefficient and therefore it is not useful for proving their conditional hardness.
In this paper, we prove the conditional hardness of SetDisjointness and SetIntersection with bounded universe. This conditional hardness is shown for both the interplay between preprocessing and query time and the interplay between space and query time. Moreover, we present several applications of these new conditional lower bounds. These applications demonstrates the strength of our new conditional lower bounds as they exploit the limited universe size. We believe that this new framework of conditional lower bounds with bounded universe can be useful for further significant applications
General Space-Time Tradeoffs via Relational Queries
In this paper, we investigate space-time tradeoffs for answering Boolean
conjunctive queries. The goal is to create a data structure in an initial
preprocessing phase and use it for answering (multiple) queries. Previous work
has developed data structures that trade off space usage for answering time and
has proved conditional space lower bounds for queries of practical interest
such as the path and triangle query. However, most of these results cater to
only those queries, lack a comprehensive framework, and are not generalizable.
The isolated treatment of these queries also fails to utilize the connections
with extensive research on related problems within the database community. The
key insight in this work is to exploit the formalism of relational algebra by
casting the problems as answering join queries over a relational database.
Using the notion of boolean {\em adorned queries} and {\em access patterns}, we
propose a unified framework that captures several widely studied algorithmic
problems. Our main contribution is three-fold. First, we present an algorithm
that recovers existing space-time tradeoffs for several problems. The algorithm
is based on an application of the {\em join size bound} to capture the space
usage of our data structure. We combine our data structure with {\em query
decomposition} techniques to further improve the tradeoffs and show that it is
readily extensible to queries with negation. Second, we falsify two proposed
conjectures in the existing literature related to the space-time lower bound
for path queries and triangle detection for which we show unexpectedly better
algorithms. This result opens a new avenue for improving several algorithmic
results that have so far been assumed to be (conditionally) optimal. Finally,
we prove new conditional space-time lower bounds for star and path queries.Comment: Appeared in WADS 2023. Comments and suggestions are always welcom
All non-trivial variants of 3-LDT are equivalent
The popular 3-SUM conjecture states that there is no strongly subquadratic
time algorithm for checking if a given set of integers contains three distinct
elements that sum up to zero. A closely related problem is to check if a given
set of integers contains distinct such that .
This can be reduced to 3-SUM in almost-linear time, but surprisingly a reverse
reduction establishing 3-SUM hardness was not known.
We provide such a reduction, thus resolving an open question of Erickson. In
fact, we consider a more general problem called 3-LDT parameterized by integer
parameters and . In this problem, we need to
check if a given set of integers contains distinct elements
such that . For some combinations
of the parameters, every instance of this problem is a NO-instance or there
exists a simple almost-linear time algorithm. We call such variants trivial. We
prove that all non-trivial variants of 3-LDT are equivalent under subquadratic
reductions. Our main technical contribution is an efficient deterministic
procedure based on the famous Behrend's construction that partitions a given
set of integers into few subsets that avoid a chosen linear equation
The Planted -SUM Problem: Algorithms, Lower Bounds, Hardness Amplification, and Cryptography
In the average-case -SUM problem, given integers chosen uniformly at random from , the objective is to find a set of numbers that sum to 0 modulo (this set is called a solution ). In the related -XOR problem, given uniformly random Boolean vectors of length log , the objective is to find a set of of them whose bitwise-XOR is the all-zero vector. Both of these problems have widespread applications in the study of fine-grained complexity and cryptanalysis.
The feasibility and complexity of these problems depends on the relative values of , , and . The dense regime of , where solutions exist with high probability, is quite well-understood and we have several non-trivial algorithms and hardness conjectures here. Much less is known about the sparse regime of , where solutions are unlikely to exist. The best answers we have for many fundamental questions here are limited to whatever carries over from the dense or worst-case settings.
We study the planted -SUM and -XOR problems in the sparse regime. In these problems, a random solution is planted in a randomly generated instance and has to be recovered. As increases past , these planted solutions tend to be the only solutions with increasing probability, potentially becoming easier to find. We show several results about the complexity and applications of these problems.
Conditional Lower Bounds. Assuming established conjectures about the hardness of average-case (non-planted) -SUM when , we show non-trivial lower bounds on the running time of algorithms for planted -SUM when . We show the same for -XOR as well.
Search-to-Decision Reduction. For any , suppose there is an algorithm running in time that can distinguish between a random -SUM instance and a random instance with a planted solution, with success probability . Then, for the same , there is an algorithm running in time that solves planted -SUM with constant probability. The same holds for -XOR as well.
Hardness Amplification. For any , if an algorithm running in time solves planted -XOR with success probability , then there is an algorithm running in time that solves it with probability . We show this by constructing a rapidly mixing random walk over -XOR instances that preserves the planted solution.
Cryptography. For some , the hardness of the -XOR problem can be used to construct Public-Key Encryption (PKE) assuming that the Learning Parity with Noise (LPN) problem with constant noise rate is hard for -time algorithms. Previous constructions of PKE from LPN needed either a noise rate of , or hardness for -time algorithms.
Algorithms. For any , there is a constant (independent of ) and an algorithm running in time that, for any , solves planted -SUM with success probability . We get this by showing an average-case reduction from planted -SUM to the Subset Sum problem. For , the best known algorithms are still the worst-case -SUM algorithms running in time
Tight Quantum Time-Space Tradeoffs for Function Inversion
In function inversion, we are given a function , and want to prepare some advice of size , such that we can efficiently invert any image in time . This is a well studied problem with profound connections to cryptography, data structures, communication complexity, and circuit lower bounds. Investigation of this problem in the quantum setting was initiated by Nayebi, Aaronson, Belovs, and Trevisan (2015), who proved a lower bound of for random permutations against classical advice, leaving open an intriguing possibility that Grover\u27s search can be sped up to time . Recent works by Hhan, Xagawa, and Yamakawa (2019), and Chung, Liao, and Qian (2019) extended the argument for random functions and quantum advice, but the lower bound remains .
In this work, we prove that even with quantum advice, is required for an algorithm to invert random functions. This demonstrates that Grover\u27s search is optimal for , ruling out any substantial speed-up for Grover\u27s search even with quantum advice. Further improvements to our bounds would imply new classical circuit lower bounds, as shown by Corrigan-Gibbs and Kogan (2019).
To prove this result, we develop a general framework for establishing quantum time-space lower bounds. We further demonstrate the power of our framework by proving the following results.
* Yao\u27s box problem: We prove a tight quantum time-space lower bound for classical advice. For quantum advice, we prove a first time-space lower bound using shadow tomography. These results resolve two open problems posted by Nayebi et al (2015).
* Salted cryptography: We show that “salting generically provably defeats preprocessing,” a result shown by Coretti, Dodis, Guo, and Steinberger (2018), also holds in the quantum setting. In particular, we prove quantum time-space lower bounds for a wide class of salted cryptographic primitives in the quantum random oracle model. This yields a first quantum time-space lower bound for salted collision-finding, which in turn implies that relative to a random oracle