Cited By
View all- 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
- Chattopadhyay AKoucký MLoff BMukhopadhyay S(2019)Simulation Theorems via Pseudo-random Propertiescomputational complexity10.1007/s00037-019-00190-7Online publication date: 18-Jul-2019
- Show More Cited By