"Deterministically Counting Satisfying Assignments for Constant-Depth ..."

Ninad Rajgopal, Rahul Santhanam, Srikanth Srinivasan (2018)

> Home

Details and statistics

DOI: 10.4230/LIPICS.MFCS.2018.78

access: open

type: Conference or Workshop Paper

metadata version: 2024-10-06

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/mfcs/RajgopalS018
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/RajgopalS018
Ninad Rajgopal, Rahul Santhanam, Srikanth Srinivasan:
Deterministically Counting Satisfying Assignments for Constant-Depth Circuits with Parity Gates, with Implications for Lower Bounds. MFCS 2018: 78:1-78:15

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.