[2201.10997] Linear Branching Programs and Directional Affine Extractors
source link: https://arxiv.org/abs/2201.10997
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
[Submitted on 26 Jan 2022]
Linear Branching Programs and Directional Affine Extractors
A natural model of read-once linear branching programs is a branching program where queries are F2 linear forms, and along each path, the queries are linearly independent. We consider two restrictions of this model, which we call weakly and strongly read-once, both generalizing standard read-once branching programs and parity decision trees. Our main results are as follows.
- Average-case complexity. We define a pseudo-random class of functions which we call directional affine extractors, and show that these functions are hard on average for the strongly read-once model. We then present an explicit construction of such function with good parameters. This strengthens the result of Cohen and Shinkar (ITCS'16) who gave such average-case hardness for parity decision trees. Directional affine extractors are stronger than the more familiar class of affine extractors. Given the significance of these functions, we expect that our new class of functions might be of independent interest.
- Proof complexity. We also consider the proof system Res[⊕] which is an extension of resolution with linear queries. A refutation of a CNF in this proof system naturally defines a linear branching program solving the corresponding search problem. Conversely, we show that a weakly read-once linear BP solving the search problem can be converted to a Res[⊕] refutation with constant blow up.
Aggregate valuable and interesting links.
Joyk means Joy of geeK