Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms

Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms

Show other versions (1)

Bibliographic Details
Main Authors:	Vyas, Nikhil, Williams, R. Ryan
Other Authors:	Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format:	Article
Language:	English
Published:	2021
Online Access:	https://hdl.handle.net/1721.1/137787

Similar Items

Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms
by: Vyas, Nikhil, et al.
Published: (2022)

An average-case lower bound against ACC$^0$
by: Chen, R, et al.
Published: (2018)

Satisfiability Algorithms and Connections between Algorithms and Circuit Lower Bounds
by: Vyas, Nikhil
Published: (2023)

Circuit-size Lower Bounds and Non-reducibility to Sparse Sets
by: Kannan, Ravindran
Published: (2023)

Easiness amplification and uniform circuit lower bounds
by: Williams, Richard Ryan, et al.
Published: (2021)

Lower bounds for sparse recovery
by: Indyk, Piotr, et al.
Published: (2011)

Algorithms and lower bounds for sparse recovery
by: Price, Eric (Eric C.)
Published: (2011)

Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity
by: Williams, Richard Ryan, et al.
Published: (2021)

Consistency of circuit lower bounds with bounded theories
by: Jan Bydzovsky, et al.
Published: (2020-06-01)

Relations and equivalences between circuit lower bounds and Karp-Lipton theorems
by: Williams, Richard Ryan, et al.
Published: (2021)

Algorithms and lower bounds in the streaming and sparse recovery models
by: Do Ba, Khanh
Published: (2012)

Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP
by: Murray, Cody (Cody Daniel), et al.
Published: (2021)

Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New Easy Witness Lemma
by: Murray, Cody D, et al.
Published: (2021)

Lower bounds for sparse matrix vector multiplication on hypercubic networks
by: Giovanni Manzini
Published: (1998-01-01)

Reducibility and computational lower bounds for problems with planted sparse structure
by: Brennan, Matthew (Matthew Stewart)
Published: (2018)

Lower bounds for sparse matrix vector multiplication on hypercubic networks
by: Giovanni Manzini
Published: (1998-12-01)

Connections between circuit analysis problems and circuit lower bounds
by: Murray, Cody (Cody Daniel)
Published: (2019)

An Improved Lower Bound for Sparse Reconstruction from Subsampled Hadamard Matrices
by: Jaroslaw Blasiok, et al.
Published: (2023-05-01)

An efficient SAT encoding of circuit codes
by: Chebiryak, Y, et al.
Published: (2008)

Complexity Lower Bounds from Algorithm Design
by: Williams, R Ryan
Published: (2022)

Highly symmetric expanders
by: Chee, Yeow Meng, et al.
Published: (2013)

Differentially Private Sparse Covariance Matrix Estimation under Lower-Bounded Moment Assumption
by: Huimin Li, et al.
Published: (2023-08-01)

Conspiracies between learning algorithms, circuit lower bounds and pseudorandomness
by: Oliveira, I, et al.
Published: (2017)

Lower bounds on the classical simulation of quantum circuits for quantum supremacy
by: Dalzell, Alexander M
Published: (2017)

Average-case lower bounds and satisfiability algorithms for small threshold circuits
by: Santhanam, R, et al.
Published: (2016)

Average-case lower bounds and satisfiability algorithms for small threshold circuits
by: Chen, R, et al.
Published: (2018)

Weak Lower Bounds on Resource-Bounded Compression Imply Strong Separations of Complexity Classes
by: McKay, Dylan M., et al.
Published: (2021)

A SAT Solver for Circuits Based on the Tableau Method
by: Egly, U, et al.
Published: (2010)

Expanding the reach of heavy neutrino searches at the LHC
by: Andrés Flórez, et al.
Published: (2018-03-01)

Quantum Circuits for Sparse Isometries
by: Emanuel Malvetti, et al.
Published: (2021-03-01)

Circuit lower bounds from NP-hardness of MCSP under Turing reductions
by: Saks, M, et al.
Published: (2020)

On the construction of sparse matrices from expander graphs
by: Bah, B, et al.
Published: (2018)

On the Construction of Sparse Matrices From Expander Graphs
by: Bubacarr Bah, et al.
Published: (2018-09-01)

Averages Along the Primes: Improving and Sparse Bounds
by: Han Rui, et al.
Published: (2020-02-01)

Expanding the Reach of Quantum Enhanced Gravitational-Wave Detectors
by: Ganapathy, Dhruva
Published: (2024)

Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty
by: Attiya, Hagit, et al.
Published: (2023)

Tunable Geometries in Sparse Clifford Circuits
by: Tomohiro Hashizume, et al.
Published: (2022-03-01)

Upper bounds for symmetric Markov transition functions
Published: (2003)

Directed ACC signaling patterns as MDD biomarker
by: Nolan Williams
Published: (2023-01-01)

Three-Dimensional Source Localization with Sparse Symmetric Cross Array
by: Haowei Wu, et al.
Published: (2022-06-01)