Unconditional pseudorandom generators for low degree polynomials. - Shachar Lovett (Electron. Colloquium Comput. Complex., 2007)

Tight lower bounds for adaptive linearity tests. - Shachar Lovett (Electron. Colloquium Comput. Complex., 2007)

Inverse Conjecture for the Gowers norm is false. - Shachar Lovett; Roy Meshulam; Alex Samorodnitsky (Electron. Colloquium Comput. Complex., 2007)

Almost Euclidean sections of the N-dimensional cross-polytope using O(N) random bits. - Shachar Lovett; Sasha Sodin (Electron. Colloquium Comput. Complex., 2007)

Lower bounds for adaptive linearity tests. - Shachar Lovett (STACS, 2008)

Worst case to Average case reductions for polynomials. - Shachar Lovett; Tali Kaufman (Electron. Colloquium Comput. Complex., 2008)

The List-Decoding Size of Reed-Muller Codes. - Shachar Lovett; Tali Kaufman (Electron. Colloquium Comput. Complex., 2008)

Pseudorandom Bit Generators That Fool Modular Sums. - Shachar Lovett; Omer Reingold; Luca Trevisan 001; Salil P. Vadhan (APPROX-RANDOM, 2009)

On cryptography with auxiliary input. - Yevgeniy Dodis; Yael Tauman Kalai; Shachar Lovett (STOC, 2009)

Polynomial Threshold Functions: Structure, Approximation and Pseudorandomness - Ido Ben-Eliezer; Shachar Lovett; Ariel Yadin (CoRR, 2009)

The density of weights of Generalized Reed-Muller codes. - Shachar Lovett (Electron. Colloquium Comput. Complex., 2009)

Title: Polynomial Threshold Functions: Structure, Approximation and Pseudorandomness. - Shachar Lovett; Ido Ben-Eliezer; Ariel Yadin (Electron. Colloquium Comput. Complex., 2009)

Explicit lower bound for fooling polynomials by the sum of small-bias generators. - Shachar Lovett; Yoav Tzur (Electron. Colloquium Comput. Complex., 2009)

The Complexity of Boolean Functions in Different Characteristics. - Parikshit Gopalan; Amir Shpilka; Shachar Lovett (Comput. Complex., 2010)

Higher-order Fourier analysis of Fpn and the complexity of systems of linear forms. - Hamed Hatami; Shachar Lovett (Electron. Colloquium Comput. Complex., 2010)

Testing of exponentially large codes, by a new extension to Weil bound for character sums. - Tali Kaufman; Shachar Lovett (Electron. Colloquium Comput. Complex., 2010)

Equivalence of polynomial conjectures in additive combinatorics. - Shachar Lovett (Electron. Colloquium Comput. Complex., 2010)

An elementary proof of anti-concentration of polynomials in Gaussian variables. - Shachar Lovett (Electron. Colloquium Comput. Complex., 2010)

Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields. - Shachar Lovett; Partha Mukhopadhyay; Amir Shpilka (Electron. Colloquium Comput. Complex., 2010)

A lower bound for dynamic approximate membership data structures. - Shachar Lovett; Ely Porat (Electron. Colloquium Comput. Complex., 2010)

Holes in generalized Reed-Muller codes. - Shachar Lovett (IEEE Trans. Inf. Theory, 2010)

Correlation Bounds for Poly-size $ mbox{ rm AC}^0$ Circuits with n 1 - o(1) Symmetric Gates. - Shachar Lovett; Srikanth Srinivasan 001 (APPROX-RANDOM, 2011)

Linear Systems over Finite Abelian Groups. - Arkadev Chattopadhyay; Shachar Lovett (CCC, 2011)

New Extension of the Weil Bound for Character Sums with Applications to Coding. - Tali Kaufman; Shachar Lovett (FOCS, 2011)

Correlation Testing for Affine Invariant Properties on $ mathbb{F}_p^n$ in the High Error Regime - Hamed Hatami; Shachar Lovett (CoRR, 2011)

On the Furthest Hyperplane Problem and Maximal Margin Clustering - Edo Liberty; Shachar Lovett; Omri Weinstein (CoRR, 2011)

Almost k-wise vs. k-wise independent permutations, and uniformity for general group actions. - Noga Alon; Shachar Lovett (Electron. Colloquium Comput. Complex., 2011)

An additive combinatorics approach to the log-rank conjecture in communication complexity. - Eli Ben-Sasson; Shachar Lovett; Noga Zewi (Electron. Colloquium Comput. Complex., 2011)

Linear systems over abelian groups. - Arkadev Chattopadhyay; Shachar Lovett (Electron. Colloquium Comput. Complex., 2011)

Subspace Evasive Sets. - Zeev Dvir; Shachar Lovett (Electron. Colloquium Comput. Complex., 2011)

Correlation testing for affine invariant properties on Fpn in the high error regime. - Hamed Hatami; Shachar Lovett (Electron. Colloquium Comput. Complex., 2011)

Probabilistic existence of rigid combinatorial structures. - Greg Kuperberg; Shachar Lovett; Ron Peled (Electron. Colloquium Comput. Complex., 2011)

Computing polynomials with few multiplications. - Shachar Lovett (Electron. Colloquium Comput. Complex., 2011)

Pseudorandom Generators for Read-Once ACC^0. - Dmitry Gavinsky; Shachar Lovett; Srikanth Srinivasan 001 (CCC, 2012)

Unsupervised SVMs: On the Complexity of the Furthest Hyperplane Problem. - Zohar Shay Karnin; Edo Liberty; Shachar Lovett; Roy Schwartz 002; Omri Weinstein (COLT, 2012)

Random low-degree polynomials are hard to approximate. - Ido Ben-Eliezer; Rani Hod; Shachar Lovett (Comput. Complex., 2012)

Bounded-Depth Circuits Cannot Sample Good Codes. - Shachar Lovett; Emanuele Viola (Comput. Complex., 2012)

Large Deviation Bounds for Decision Trees and Sampling Lower Bounds for AC0-circuits. - Chris Beck; Russell Impagliazzo; Shachar Lovett (Electron. Colloquium Comput. Complex., 2012)

Every locally characterized affine-invariant property is testable. - Arnab Bhattacharyya 001; Eldar Fischer; Hamed Hatami; Pooya Hatami; Shachar Lovett (Electron. Colloquium Comput. Complex., 2012)

Testing Low Complexity Affine-Invariant Properties. - Arnab Bhattacharyya 001; Eldar Fischer; Shachar Lovett (Electron. Colloquium Comput. Complex., 2012)

New Lower Bounds for Matching Vector Codes. - Abhishek Bhowmick 001; Zeev Dvir; Shachar Lovett (Electron. Colloquium Comput. Complex., 2012)

The Freiman-Ruzsa Theorem in Finite Fields. - Chaim Even-Zohar; Shachar Lovett (Electron. Colloquium Comput. Complex., 2012)

A Tail Bound for Read-k Families of Functions. - Dmitry Gavinsky; Shachar Lovett; Michael E. Saks; Srikanth Srinivasan 001 (Electron. Colloquium Comput. Complex., 2012)

An exposition of Sanders quasi-polynomial Freiman-Ruzsa theorem. - Shachar Lovett (Electron. Colloquium Comput. Complex., 2012)

Weight Distribution and List-Decoding Size of Reed-Muller Codes. - Tali Kaufman; Shachar Lovett; Ely Porat (IEEE Trans. Inf. Theory, 2012)

Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields. - Shachar Lovett; Partha Mukhopadhyay; Amir Shpilka (Comput. Complex., 2013)

Probabilistic existence of regular combinatorial structures - Greg Kuperberg; Shachar Lovett; Ron Peled (CoRR, 2013)

En Route to the log-rank Conjecture: New Reductions and Equivalent Formulations. - Dmitry Gavinsky; Shachar Lovett (Electron. Colloquium Comput. Complex., 2013)

Estimating the distance from testable affine-invariant properties. - Hamed Hatami; Shachar Lovett (Electron. Colloquium Comput. Complex., 2013)

Communication is bounded by root of rank. - Shachar Lovett (Electron. Colloquium Comput. Complex., 2013)

A Space Lower Bound for Dynamic Approximate Membership Data Structures. - Shachar Lovett; Ely Porat (SIAM J. Comput., 2013)

Cooperative weakest link games. - Yoram Bachrach; Omer Lev; Shachar Lovett; Jeffrey S. Rosenschein; Morteza Zadimoghaddam (AAMAS, 2014)

Variety Evasive Sets. - Zeev Dvir; János Kollár; Shachar Lovett (Comput. Complex., 2014)

Nonclassical polynomials as a barrier to polynomial lower bounds. - Abhishek Bhowmick 001; Shachar Lovett (Electron. Colloquium Comput. Complex., 2014)

List decoding Reed-Muller codes over small fields. - Abhishek Bhowmick 001; Shachar Lovett (Electron. Colloquium Comput. Complex., 2014)

General systems of linear forms: equidistribution and true complexity. - Hamed Hatami; Pooya Hatami; Shachar Lovett (Electron. Colloquium Comput. Complex., 2014)

0-1 Integer Linear Programming with a Linear Number of Constraints. - Russell Impagliazzo; Shachar Lovett; Ramamohan Paturi; Stefan Schneider 003 (Electron. Colloquium Comput. Complex., 2014)

Recent advances on the log-rank conjecture in communication complexity. - Shachar Lovett (Electron. Colloquium Comput. Complex., 2014)

Linear codes cannot approximate the network capacity within any constant factor. - Shachar Lovett (Electron. Colloquium Comput. Complex., 2014)

Group representations that resist random sampling. - Shachar Lovett; Cristopher Moore; Alexander Russell (Electron. Colloquium Comput. Complex., 2014)

Improved noisy population recovery, and reverse Bonami-Beckner inequality for sparse functions. - Shachar Lovett; Jiapeng Zhang (Electron. Colloquium Comput. Complex., 2014)

An Additive Combinatorics Approach Relating Rank to Communication Complexity. - Eli Ben-Sasson; Shachar Lovett; Noga Ron-Zewi (J. ACM, 2014)

The Freiman-Ruzsa theorem over finite fields. - Chaim Even-Zohar; Shachar Lovett (J. Comb. Theory A, 2014)

Nontrivial t-designs over finite fields exist for all t. - Arman Fazeli; Shachar Lovett; Alexander Vardy (J. Comb. Theory A, 2014)

New Bounds for Matching Vector Families. - Abhishek Bhowmick 001; Zeev Dvir; Shachar Lovett (SIAM J. Comput., 2014)

Correlation Testing for Affine Invariant Properties on 픽pn in the High Error Regime. - Hamed Hatami; Shachar Lovett (SIAM J. Comput., 2014)

Large Supports are Required for Well-Supported Nash Equilibria. - Yogesh Anbalagan; Hao Huang; Shachar Lovett; Sergey Norin; Adrian Vetta; Hehui Wu (APPROX-RANDOM, 2015)

Bias vs structure of polynomials in large fields, and applications in effective algebraic geometry and coding theory. - Abhishek Bhowmick 001; Shachar Lovett (Electron. Colloquium Comput. Complex., 2015)

Affine-malleable Extractors, Spectrum Doubling, and Application to Privacy Amplification. - Divesh Aggarwal; Kaave Hosseini; Shachar Lovett (Electron. Colloquium Comput. Complex., 2015)

On the Beck-Fiala Conjecture for Random Set Systems. - Esther Ezra; Shachar Lovett (Electron. Colloquium Comput. Complex., 2015)

A tail bound for read-k families of functions. - Dmitry Gavinsky; Shachar Lovett; Michael E. Saks; Srikanth Srinivasan 001 (Random Struct. Algorithms, 2015)

Constructive Discrepancy Minimization by Walking on the Edges. - Shachar Lovett; Raghu Meka (SIAM J. Comput., 2015)

Structure of protocols for XOR functions. - Kaave Hosseini; Shachar Lovett (Electron. Colloquium Comput. Complex., 2016)

The Fourier structure of low degree polynomials. - Shachar Lovett (Electron. Colloquium Comput. Complex., 2016)

Noisy Population Recovery from Unknown Noise. - Shachar Lovett; Jiapeng Zhang (Electron. Colloquium Comput. Complex., 2016)

On the impossibility of entropy reversal, and its application to zero-knowledge proofs. - Shachar Lovett; Jiapeng Zhang (Electron. Colloquium Comput. Complex., 2016)

Robust sensitivity. - Shachar Lovett; Jiapeng Zhang (Electron. Colloquium Comput. Complex., 2016)

Rectangles Are Nonnegative Juntas. - Mika Göös; Shachar Lovett; Raghu Meka; Thomas Watson 001; David Zuckerman (SIAM J. Comput., 2016)

Near-optimal linear decision trees for k-SUM and related problems. - Daniel M. Kane; Shachar Lovett; Shay Moran (Electron. Colloquium Comput. Complex., 2017)

Active classification with comparison queries. - Daniel M. Kane; Shachar Lovett; Shay Moran; Jiapeng Zhang (Electron. Colloquium Comput. Complex., 2017)

Labeling the complete bipartite graph with no zero cycles. - Daniel M. Kane; Shachar Lovett; Sankeerth Rao (Electron. Colloquium Comput. Complex., 2017)

On the structure of the spectrum of small sets. - Kaave Hosseini; Shachar Lovett (J. Comb. Theory A, 2017)

Additive Combinatorics and its Applications in Theoretical Computer Science. - Shachar Lovett (Theory Comput., 2017)

MDS Matrices over Small Fields: A Proof of the GM-MDS Conjecture. - Shachar Lovett (FOCS, 2018)

The Robust Sensitivity of Boolean Functions. - Shachar Lovett; Avishay Tal; Jiapeng Zhang (SODA, 2018)

Torus polynomials: an algebraic approach to ACC lower bounds. - Abhishek Bhrushundi; Kaave Hosseini; Shachar Lovett; Sankeerth Rao (Electron. Colloquium Comput. Complex., 2018)

Hardness Amplification for Non-Commutative Arithmetic Circuits. - Marco Carmosino; Russell Impagliazzo; Shachar Lovett; Ivan Mihajlin (Electron. Colloquium Comput. Complex., 2018)

Pseudorandom Generators from Polarizing Random Walks. - Eshan Chattopadhyay; Pooya Hatami; Kaave Hosseini; Shachar Lovett (Electron. Colloquium Comput. Complex., 2018)

Pseudorandom generators from the second Fourier level and applications to AC0 with parity gates. - Eshan Chattopadhyay; Pooya Hatami; Shachar Lovett; Avishay Tal (Electron. Colloquium Comput. Complex., 2018)

Equality Alone Does Not Simulate Randomness. - Arkadev Chattopadhyay; Shachar Lovett; Marc Vinyals (Electron. Colloquium Comput. Complex., 2018)

A bilinear Bogolyubov-Ruzsa lemma with poly-logarithmic bounds. - Kaave Hosseini; Shachar Lovett (Electron. Colloquium Comput. Complex., 2018)

Optimality of Linear Sketching under Modular Updates. - Kaave Hosseini; Shachar Lovett; Grigory Yaroslavtsev (Electron. Colloquium Comput. Complex., 2018)

Generalized comparison trees for point-location problems. - Daniel M. Kane; Shachar Lovett; Shay Moran (Electron. Colloquium Comput. Complex., 2018)

Sunflowers and Quasi-sunflowers from Randomness Extractors. - Xin Li 006; Shachar Lovett; Jiapeng Zhang (Electron. Colloquium Comput. Complex., 2018)

A proof of the GM-MDS conjecture. - Shachar Lovett (Electron. Colloquium Comput. Complex., 2018)

DNF sparsification beyond sunflowers. - Shachar Lovett; Jiapeng Zhang (Electron. Colloquium Comput. Complex., 2018)

Non-Malleable Codes from Additive Combinatorics. - Divesh Aggarwal; Yevgeniy Dodis; Shachar Lovett (SIAM J. Comput., 2018)

Algebraic Attacks against Random Local Functions and Their Countermeasures. - Benny Applebaum; Shachar Lovett (SIAM J. Comput., 2018)

Structure of Protocols for XOR Functions. - Hamed Hatami; Kaave Hosseini; Shachar Lovett (SIAM J. Comput., 2018)

The List Decoding Radius for Reed-Muller Codes Over Small Fields. - Abhishek Bhowmick 001; Shachar Lovett (IEEE Trans. Inf. Theory, 2018)

Special Issue: CCC 2017: Guest Editor's Foreword. - Shachar Lovett; Ryan O'Donnell (Theory Comput., 2018)

Improved bounds for the sunflower lemma. - Ryan Alweiss; Shachar Lovett; Kewen Wu 001; Jiapeng Zhang (Electron. Colloquium Comput. Complex., 2019)

XOR Lemmas for Resilient Functions Against Polynomials. - Eshan Chattopadhyay; Pooya Hatami; Kaave Hosseini; Shachar Lovett; David Zuckerman (Electron. Colloquium Comput. Complex., 2019)

Sign rank vs Discrepancy. - Hamed Hatami; Kaave Hosseini; Shachar Lovett (Electron. Colloquium Comput. Complex., 2019)

From DNF compression to sunflower theorems via regularity. - Shachar Lovett; Noam Solomon; Jiapeng Zhang (Electron. Colloquium Comput. Complex., 2019)

Decision list compression by mild random restrictions. - Shachar Lovett; Kewen Wu 001; Jiapeng Zhang (Electron. Colloquium Comput. Complex., 2019)

Higher-order Fourier Analysis and Applications. - Hamed Hatami; Pooya Hatami; Shachar Lovett (Found. Trends Theor. Comput. Sci., 2019)

The Independence Number of the Birkhoff Polytope Graph, and Applications to Maximally Recoverable Codes. - Daniel Kane 001; Shachar Lovett; Sankeerth Rao (SIAM J. Comput., 2019)

The Gram-Schmidt Walk: A Cure for the Banaszczyk Blues. - Nikhil Bansal 001; Daniel Dadush; Shashwat Garg; Shachar Lovett (Theory Comput., 2019)

Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem. - Daniel Dadush; Shashwat Garg; Shachar Lovett; Aleksandar Nikolov (Theory Comput., 2019)

Noise-tolerant, Reliable Active Classification with Comparison Queries. - Max Hopkins; Daniel Kane 001; Shachar Lovett; Gaurav Mahajan (COLT, 2020)

Point Location and Active Learning: Learning Halfspaces Almost Optimally. - Max Hopkins; Daniel Kane 001; Shachar Lovett; Gaurav Mahajan (FOCS, 2020)

Towards a Combinatorial Characterization of Bounded-Memory Learning. - Alon Gonen; Shachar Lovett; Michal Moshkovitz (NeurIPS, 2020)

The Power of Comparisons for Actively Learning Linear Classifiers. - Max Hopkins; Daniel Kane 001; Shachar Lovett (NeurIPS, 2020)

High Dimensional Expanders: Random Walks, Pseudorandomness, and Unique Games. - Max Hopkins; Tali Kaufman; Shachar Lovett (Electron. Colloquium Comput. Complex., 2020)

Codes over integers, and the singularity of random matrices with large entries. - Sankeerth Rao Karingula; Shachar Lovett (Electron. Colloquium Comput. Complex., 2020)

Log-rank and lifting for AND-functions. - Alexander Knop; Shachar Lovett; Sam McGuire; Weiqiang Yuan 002 (Electron. Colloquium Comput. Complex., 2020)

Improved lifting theorems via robust sunflowers. - Shachar Lovett; Raghu Meka; Jiapeng Zhang (Electron. Colloquium Comput. Complex., 2020)

Probabilistic existence of large sets of designs. - Shachar Lovett; Sankeerth Rao; Alexander Vardy (J. Comb. Theory A, 2020)

Singularity of Random Integer Matrices with Large Entries. - Sankeerth Rao Karingula; Shachar Lovett (APPROX-RANDOM, 2021)

Fractional Pseudorandom Generators from Any Fourier Level. - Eshan Chattopadhyay; Jason Gaitonde; Chin Ho Lee; Shachar Lovett; Abhishek Shetty (CCC, 2021)

Bounded Memory Active Learning through Enriched Queries. - Max Hopkins; Daniel Kane 001; Shachar Lovett; Michal Moshkovitz (COLT, 2021)

Bilinear Classes: A Structural Framework for Provable Generalization in RL. - Simon S. Du; Sham M. Kakade; Jason D. Lee; Shachar Lovett; Gaurav Mahajan; Wen Sun 002; Ruosong Wang (ICML, 2021)

Hypercontractivity on High Dimensional Expanders: a Local-to-Global Approach for Higher Moments. - Mitali Bafna; Max Hopkins; Tali Kaufman; Shachar Lovett (Electron. Colloquium Comput. Complex., 2021)

Sparse MDS Matrices over Small Fields: A Proof of the GM-MDS Conjecture. - Shachar Lovett (SIAM J. Comput., 2021)

Guest Column: Models of computation between decision trees and communication. - Alexander Knop; Shachar Lovett; Sam McGuire; Weiqiang Yuan 002 (SIGACT News, 2021)

Eigenstripping, Spectral Decay, and Edge-Expansion on Posets. - Jason Gaitonde; Max Hopkins; Tali Kaufman; Shachar Lovett; Ruizhe Zhang 001 (APPROX/RANDOM, 2022)

Computational-Statistical Gap in Reinforcement Learning. - Daniel Kane 001; Sihan Liu; Shachar Lovett; Gaurav Mahajan (COLT, 2022)

Lifting with Sunflowers. - Shachar Lovett; Raghu Meka; Ian Mertz; Toniann Pitassi; Jiapeng Zhang (ITCS, 2022)

High Dimensional Expanders: Eigenstripping, Pseudorandomness, and Unique Games. - Mitali Bafna; Max Hopkins; Tali Kaufman; Shachar Lovett (SODA, 2022)

Hypercontractivity on high dimensional expanders. - Mitali Bafna; Max Hopkins; Tali Kaufman; Shachar Lovett (STOC, 2022)

Computational-Statistical Gaps in Reinforcement Learning. - Daniel Kane 001; Sihan Liu; Shachar Lovett; Gaurav Mahajan (CoRR, 2022)

Fractional certificates for bounded functions. - Shachar Lovett; Jiapeng Zhang (Electron. Colloquium Comput. Complex., 2022)

Sunflowers and Robust Sunflowers from Randomness Extractors. - Xin Li 006; Shachar Lovett; Jiapeng Zhang (Adv. Math. Commun., 2022)

Exponential Hardness of Reinforcement Learning with Linear Function Approximation. - Sihan Liu; Gaurav Mahajan; Daniel Kane 001; Shachar Lovett; Gellért Weisz; Csaba Szepesvári (COLT, 2023)

Sampling Equilibria: Fast No-Regret Learning in Structured Games. - Daniel Beaglehole; Max Hopkins; Daniel Kane 001; Sihan Liu; Shachar Lovett (SODA, 2023)

New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms. - Amir Abboud; Nick Fischer; Zander Kelley; Shachar Lovett; Raghu Meka (Electron. Colloquium Comput. Complex., 2023)

Refuting approaches to the log-rank conjecture for XOR functions. - Hamed Hatami; Kaave Hosseini; Shachar Lovett; Anthony Ostuni (Electron. Colloquium Comput. Complex., 2023)

Explicit separations between randomized and deterministic Number-on-Forehead communication. - Zander Kelley; Shachar Lovett; Raghu Meka (Electron. Colloquium Comput. Complex., 2023)

Streaming Lower Bounds and Asymmetric Set-Disjointness. - Shachar Lovett; Jiapeng Zhang (Electron. Colloquium Comput. Complex., 2023)

Bias vs Structure of Polynomials in Large Fields, and Applications in Information Theory. - Abhishek Bhowmick 001; Shachar Lovett (IEEE Trans. Inf. Theory, 2023)

Corners in Quasirandom Groups via Sparse Mixing. - Michael Jaber; Shachar Lovett; Anthony Ostuni (Electron. Colloquium Comput. Complex., 2024)

Realizable Learning is All You Need. - Max Hopkins; Daniel M. Kane; Shachar Lovett; Gaurav Mahajan (TheoretiCS, 2024)

Do PAC-Learners Learn the Marginal Distribution? - Max Hopkins; Daniel M. Kane; Shachar Lovett; Gaurav Mahajan (ALT, 2025)

List Decoding Quotient Reed-Muller Codes. - Omri Gotlib; Tali Kaufman; Shachar Lovett (CCC, 2025)

Exact versus Approximate Representations of Boolean Functions in the De Morgan Basis. - Arkadev Chattopadhyay; Yogesh Dahiya; Shachar Lovett (Electron. Colloquium Comput. Complex., 2025)

Quasipolynomial bounds for the corners theorem. - Michael Jaber; Yang P. Liu; Shachar Lovett; Anthony Ostuni; Mehtaab Sawhney (Electron. Colloquium Comput. Complex., 2025)