**Schedule** The slots for contributed talks are 30 minutes (including 5 minutes for questions and changing speakers). In addition there are tutorial sessions on Friday and Saturday, 9:00-10:00. There is also a reception Thursday at 18:00, a business meeting Friday at 17:15, and a rump session Saturday at 17:15.

**Venue** All activities except the reception take
place at the University of California, San Diego, Qualcomm Institute (CaliIT2), Atkinson Hall. The reception takes place at the Bella Vista cafe.

**Slides and Videos**
Click the word "slides" in the program to see the presentations
that the authors agreed to post on this website. Videos of the invited tutorials can be viewed by clicking on the word "video".

**Proceedings**
The official version is openly accessible via
LIPIcs.

18:00 - 20:00 | Opening Reception |

8:00 | Breakfast |

9:00 |
Tutorial (part 1)
Constraints, Consistency, and Complexity
(abstract, slides, video)Andrei Krokhin |

10:00 | Coffee break |

10:30 |
Pseudorandom Generators from Polarizing Random Walks
(slides)Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini and Shachar Lovett |

11:00 |
A PRG for Boolean PTF of Degree 2 with Seed Length Subpolynomial in $\epsilon$ and Logarithmic in $n$
Daniel Kane and Sankeerth Rao Karingula |

11:30 |
A New Approach for Constructing Low-Error, Two-Source Extractors
(slides)Dean Doron, Amnon Ta-Shma, Avraham Ben-Aroya, Eshan Chattopadhyay and Xin Li |

12:00 |
Lossless Dimension Expanders via Linearized Polynomials and Subspace Designs
(slides)Venkatesan Guruswami, Nicolas Resch and Chaoping Xing |

12:30 | Lunch |

14:00 |
NP-Hardness of Minimum Circuit Size Problem for OR-AND-MOD Circuits
(slides)Shuichi Hirahara, Igor Oliveira and Rahul Santhanam |

14:30 |
Limits on Representing Boolean Functions by Linear Combinations of Simple Functions: Thresholds, ReLUs, and Low-Degree Polynomials
(slides)Ryan Williams |

15:00 |
The Power of Natural Properties as Oracles
Russell Impagliazzo, Valentine Kabanets and Ilya Volkovich |

15:30 | Coffee break |

16:00 |
Linear Sketching over F_2
(slides)Sampath Kannan, Elchanan Mossel, Swagato Sanyal and Grigory Yaroslavtsev |

16:30 |
Communication Complexity with Small Advantage
(slides)Thomas Watson |

17:00 | Break |

17:15 | Business meeting |

8:00 | Breakfast |

9:00 |
Tutorial (part 2)
Constraints, Consistency, and Complexity
(abstract, slides, video)Andrei Krokhin |

10:00 | Coffee break |

10:30 |
Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity
(slides)Zeyu Guo, Nitin Saxena and Amit Sinhababu |

11:00 |
Unbalancing Sets and an Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits
(slides)Noga Alon, Mrinal Kumar and Ben Lee Volk |

11:30 |
Hardness Amplification for Non-Commutative Arithmetic Circuits
Marco Carmosino, Russel Impagliazzo, Shachar Lovett and Ivan Mihajlin |

12:00 |
Hardness vs Randomness for Bounded Depth Arithmetic Circuits
(slides)Chi-Ning Chou, Mrinal Kumar and Noam Solomon |

12:30 | Lunch |

14:00 |
On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product
(slides)Lijie Chen |

14:30 |
Hardness of Function Composition for Semantic Read once Branching Programs
(slides)Jeff Edmonds, Venkatesh Medabalimi and Toniann Pitassi |

15:00 |
Reordering Rule Makes OBDD Proof Systems Stronger
(slides)Sam Buss, Dmitry Itsykson, Alexander Knop and Dmitry Sokolov |

15:30 | Coffee break |

16:00 |
Testing Linearity against Non-Signaling Strategies
(slides)Alessandro Chiesa, Peter Manohar and Igor Shinkar |

16:30 |
Earthmover Resilience and Testing in Ordered Structures
(slides)Omri Ben-Eliezer and Eldar Fischer |

17:00 | Break |

17:15 | Rump session |