| dc.contributor.author | Vyas, Nikhil | |
| dc.contributor.author | Williams, R. Ryan | |
| dc.date.accessioned | 2021-11-08T19:20:43Z | |
| dc.date.available | 2021-11-08T19:20:43Z | |
| dc.date.issued | 2020 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/137787 | |
| dc.language.iso | en | |
| dc.relation.isversionof | 10.4230/LIPIcs.STACS.2020.59 | en_US |
| dc.rights | Creative Commons Attribution 4.0 International license | en_US |
| dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | en_US |
| dc.source | DROPS | en_US |
| dc.title | Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | Vyas, Nikhil and Williams, R. Ryan. 2020. "Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms." 37TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2020), 154. | |
| dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | |
| dc.relation.journal | 37TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2020) | en_US |
| dc.eprint.version | Final published version | en_US |
| dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
| eprint.status | http://purl.org/eprint/status/NonPeerReviewed | en_US |
| dc.date.updated | 2021-03-23T16:53:49Z | |
| dspace.orderedauthors | Vyas, N; Williams, RR | en_US |
| dspace.date.submission | 2021-03-23T16:53:52Z | |
| mit.journal.volume | 154 | en_US |
| mit.license | PUBLISHER_CC | |
| mit.metadata.status | Authority Work and Publication Information Needed | en_US |
