15 research outputs found
Lifting with Inner Functions of Polynomial Discrepancy
Lifting theorems are theorems that bound the communication complexity of a composed function f?g? in terms of the query complexity of f and the communication complexity of g. Such theorems constitute a powerful generalization of direct-sum theorems for g, and have seen numerous applications in recent years.
We prove a new lifting theorem that works for every two functions f,g such that the discrepancy of g is at most inverse polynomial in the input length of f. Our result is a significant generalization of the known direct-sum theorem for discrepancy, and extends the range of inner functions g for which lifting theorems hold
On Disperser/Lifting Properties of the Index and Inner-Product Functions
Query-to-communication lifting theorems, which connect the query complexity of a Boolean function to the communication complexity of an associated "lifted" function obtained by composing the function with many copies of another function known as a gadget, have been instrumental in resolving many open questions in computational complexity. A number of important complexity questions could be resolved if we could make substantial improvements in the input size required for lifting with the Index function, which is a universal gadget for lifting, from its current near-linear size down to polylogarithmic in the number of inputs N of the original function or, ideally, constant. The near-linear size bound was recently shown by Lovett, Meka, Mertz, Pitassi and Zhang [Shachar Lovett et al., 2022] using a recent breakthrough improvement on the Sunflower Lemma to show that a certain graph associated with an Index function of that size is a disperser. They also stated a conjecture about the Index function that is essential for further improvements in the size required for lifting with Index using current techniques. In this paper we prove the following;
- The conjecture of Lovett et al. is false when the size of the Index gadget is less than logarithmic in N.
- The same limitation applies to the Inner-Product function. More precisely, the Inner-Product function, which is known to satisfy the disperser property at size O(log N), also does not have this property when its size is less than log N.
- Notwithstanding the above, we prove a lifting theorem that applies to Index gadgets of any size at least 4 and yields lower bounds for a restricted class of communication protocols in which one of the players is limited to sending parities of its inputs.
- Using a modification of the same idea with improved lifting parameters we derive a strong lifting theorem from decision tree size to parity decision tree size. We use this, in turn, to derive a general lifting theorem in proof complexity from tree-resolution size to tree-like Res(?) refutation size, which yields many new exponential lower bounds on such proofs
Lifting query complexity to time-space complexity for two-way finite automata
Time-space tradeoff has been studied in a variety of models, such as Turing
machines, branching programs, and finite automata, etc. While communication
complexity as a technique has been applied to study finite automata, it seems
it has not been used to study time-space tradeoffs of finite automata. We
design a new technique showing that separations of query complexity can be
lifted, via communication complexity, to separations of time-space complexity
of two-way finite automata. As an application, one of our main results exhibits
the first example of a language such that the time-space complexity of
two-way probabilistic finite automata with a bounded error (2PFA) is
, while of exact two-way quantum finite automata with
classical states (2QCFA) is , that is, we demonstrate
for the first time that exact quantum computing has an advantage in time-space
complexity comparing to classical computing
Lifting to Parity Decision Trees via Stifling
We show that the deterministic decision tree complexity of a (partial) function or relation f lifts to the deterministic parity decision tree (PDT) size complexity of the composed function/relation f ◦ g as long as the gadget g satisfies a property that we call stifling. We observe that several simple gadgets of constant size, like Indexing on 3 input bits, Inner Product on 4 input bits, Majority on 3 input bits and random functions, satisfy this property. It can be shown that existing randomized communication lifting theorems ([Göös, Pitassi, Watson. SICOMP'20], [Chattopadhyay et al. SICOMP'21]) imply PDT-size lifting. However there are two shortcomings of this approach: first they lift randomized decision tree complexity of f, which could be exponentially smaller than its deterministic counterpart when either f is a partial function or even a total search problem. Second, the size of the gadgets in such lifting theorems are as large as logarithmic in the size of the input to f. Reducing the gadget size to a constant is an important open problem at the frontier of current research. Our result shows that even a random constant-size gadget does enable lifting to PDT size. Further, it also yields the first systematic way of turning lower bounds on the width of tree-like resolution proofs of the unsatisfiability of constant-width CNF formulas to lower bounds on the size of tree-like proofs in the resolution with parity system, i.e., Res(☉), of the unsatisfiability of closely related constant-width CNF formulas
Lifting with Sunflowers
Query-to-communication lifting theorems translate lower bounds on query complexity to lower bounds for the corresponding communication model. In this paper, we give a simplified proof of deterministic lifting (in both the tree-like and dag-like settings). Our proof uses elementary counting together with a novel connection to the sunflower lemma.
In addition to a simplified proof, our approach opens up a new avenue of attack towards proving lifting theorems with improved gadget size - one of the main challenges in the area. Focusing on one of the most widely used gadgets - the index gadget - existing lifting techniques are known to require at least a quadratic gadget size. Our new approach combined with robust sunflower lemmas allows us to reduce the gadget size to near linear. We conjecture that it can be further improved to polylogarithmic, similar to the known bounds for the corresponding robust sunflower lemmas
Exponential Separation Between Powers of Regular and General Resolution Over Parities
Proving super-polynomial lower bounds on the size of proofs of
unsatisfiability of Boolean formulas using resolution over parities is an
outstanding problem that has received a lot of attention after its introduction
by Raz and Tzamaret [Ann. Pure Appl. Log.'08]. Very recently, Efremenko,
Garl\'ik and Itsykson [ECCC'23] proved the first exponential lower bounds on
the size of ResLin proofs that were additionally restricted to be
bottom-regular. We show that there are formulas for which such regular ResLin
proofs of unsatisfiability continue to have exponential size even though there
exists short proofs of their unsatisfiability in ordinary, non-regular
resolution. This is the first super-polynomial separation between the power of
general ResLin and and that of regular ResLin for any natural notion of
regularity.
Our argument, while building upon the work of Efremenko et al., uses
additional ideas from the literature on lifting theorems