Cited By
View all- Sherstov ALeonardi SGupta A(2022)The approximate degree of DNF and CNF formulasProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3519935.3520000(1194-1207)Online publication date: 9-Jun-2022
- Kamath APrice EWoodruff D(2021)A simple proof of a new set disjointness with applications to data streamsProceedings of the 36th Computational Complexity Conference10.4230/LIPIcs.CCC.2021.37Online publication date: 20-Jul-2021
- Itsykson DRiazanov A(2021)Proof complexity of natural formulas via communication argumentsProceedings of the 36th Computational Complexity Conference10.4230/LIPIcs.CCC.2021.3Online publication date: 20-Jul-2021
- Show More Cited By