Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms
Abstract We continue the program of proving circuit lower bounds via circuit satisfiability algorithms. So far, this program has yielded several concrete results, proving that functions in...
Main Authors: | Vyas, Nikhil, Williams, R. R. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | English |
Published: |
Springer US
2022
|
Online Access: | https://hdl.handle.net/1721.1/146172 |
Similar Items
-
Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms
by: Vyas, Nikhil, et al.
Published: (2021) -
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) -
Algorithms and lower bounds for sparse recovery
by: Price, Eric (Eric C.)
Published: (2011) -
Lower bounds for sparse recovery
by: Indyk, Piotr, et al.
Published: (2011)