Lifting to parity decision trees via stifling

DOI10.4230/LIPICS.ITCS.2023.33MaRDI QIDQ6610296zbMATH OpenFDO

Authors Arkadev Chattopadhyay, Nikhil S. Mande, Swagato Sanyal, Suhail Sherif

Publication date 25 September 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ITCS.2023.33

zbMATH Keywords

decision treeslifting theoremsparity decision trees

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(6)

• Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024
• Exponential separation between powers of regular and general resolution over parities
• One-way communication complexity of partial XOR functions
• Lifting dichotomies
• Lower bounds for regular resolution over parities
• Lifting to randomized parity decision trees

This page was built for publication: Lifting to parity decision trees via stifling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6610296)