Showing 1 - 1 results of 1 for search 'Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH', query time: 0.12s Refine Results
  1. 1
    Deterministically counting satisfying assignments for constant-depth circuits with parity gates, with implications for lower bounds

    Deterministically counting satisfying assignments for constant-depth circuits with parity gates, with implications for lower bounds by Rajgopal, N, Santhanam, R, Srinivasan, S

    Published 2018
    “…Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH…”
    Conference item

Search Tools: