Export Citations
1 Results for: Keyword: affine disperser
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
Searched The ACM Guide to Computing Literature (3,766,682 records)|Limit your search to The ACM Full-Text Collection (759,490 records)
- research-articleJanuary 2016
The Complexity of DNF of Parities
ITCS '16: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer SciencePages 47–58https://doi.org/10.1145/2840728.2840734We study depth 3 circuits of the form OR-AND-XOR, or equivalently -- DNF of parities. This model was first explicitly studied by Jukna (CPC'06) who obtained a 2{Ω(n) lower bound, using graph theoretic arguments, for explicit functions. Several related ...