The Complexity of DNF of Parities
From MaRDI portal
Publication:2800552
DOI10.1145/2840728.2840734zbMath1334.68065OpenAlexW2282923620MaRDI QIDQ2800552
Publication date: 15 April 2016
Published in: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2840728.2840734
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
Expander-based cryptography meets natural proofs ⋮ Hilbert cubes meet arithmetic sets ⋮ Improving \(3N\) circuit complexity lower bounds ⋮ Gate elimination: circuit size lower bounds and \#SAT upper bounds ⋮ Property testing lower bounds via a generalization of randomized parity decision trees ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Expander-Based Cryptography Meets Natural Proofs
This page was built for publication: The Complexity of DNF of Parities
