The Complexity of DNF of Parities. Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science. https://doi.org/10.1145/2840728.2840734
Chicago Style (17th ed.) Citation"The Complexity of DNF of Parities." Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science . https://doi.org/10.1145/2840728.2840734.
MLA (9th ed.) Citation"The Complexity of DNF of Parities." Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, , https://doi.org/10.1145/2840728.2840734.
Warning: These citations may not always be 100% accurate.