Conference item
Deterministically counting satisfying assignments for constant-depth circuits with parity gates, with implications for lower bounds
- Abstract:
-
We give a deterministic algorithm for counting the number of satisfying assignments of any AC0[] circuit C of size s and depth d over n variables in time 2n-f (n;s;d), where f (n; s; d) = n=O(log(s))d-1, whenever s = 2o(n1=d ). As a consequence, we get that for each d, there is a language in ENP that does not have AC0[] circuits of size 2o(n1=(d+1)). This is the first lower bound in ENP against AC0[] circuits that beats the lower bound of 2 (n1=2(d-1)) due to Razborov and Smolensky for large ...
Expand abstract
- Publication status:
- Accepted
- Peer review status:
- Reviewed (other)
Actions
Access Document
- Files:
-
-
(Version of record, pdf, 583.7KB)
-
- Publisher copy:
- 10.4230/LIPIcs.MFCS.2018.78
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
Authors
Funding
Bibliographic Details
- Publisher:
- Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH Publisher's website
- Journal:
- 43rd International Symposium on Mathematical Foundations of Computer Science Journal website
- Host title:
- Leibniz International Proceedings in Informatics; 43rd International Symposium on Mathematical Foundations of Computer Science
- Publication date:
- 2018-08-13
- Acceptance date:
- 2018-08-13
- DOI:
- Source identifiers:
-
908932
Item Description
- Keywords:
- Pubs id:
-
pubs:908932
- UUID:
-
uuid:98b7b047-54b1-40d8-ba47-55467c3de7e4
- Local pid:
- pubs:908932
- Deposit date:
- 2018-08-18
Terms of use
- Copyright holder:
- Rajgopal et al
- Copyright date:
- 2018
- Notes:
-
© Ninad Rajgopal, Rahul Santhanam and Srikanth Srinivasan;
licensed under Creative Commons License CC-BY
43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018).
- Licence:
- CC Attribution (CC BY)
If you are the owner of this record, you can report an update to it here: Report update to this record