No. Title Author Year
1 Extremely Deep Proofs Fleming, Noah et al. 2022
2 Lifting with Sunflowers Lovett, Shachar et al. 2022
3 Secret Sharing, Slice Formulas, and Monotone Real Circuits Applebaum, Benny et al. 2022
4 Algebraic Proof Systems (Invited Talk) Pitassi, Toniann 2021
5 On the Power and Limitations of Branch and Cut Fleming, Noah et al. 2021
6 On the Pseudo-Deterministic Query Complexity of NP Search Problems Goldwasser, Shafi et al. 2021
7 Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity Pitassi, Toniann et al. 2020
8 Progress in Lifting and Applications in Lower Bounds (Invited Talk) Pitassi, Toniann 2019
9 Query-To-Communication Lifting for BPP Using Inner Product Chattopadhyay, Arkadev et al. 2019
10 Short Proofs Are Hard to Find Mertz, Ian et al. 2019
11 Hardness of Function Composition for Semantic Read once Branching Programs Edmonds, Jeff et al. 2018
12 On the Communication Complexity of High-Dimensional Permutations Linial, Nati et al. 2018
13 Stabbing Planes Beame, Paul et al. 2018
14 Query-to-Communication Lifting for P^NP Göös, Mika et al. 2017
15 Randomized Communication vs. Partition Number Göös, Mika et al. 2017
16 Lower Bounds for Nondeterministic Semantic Read-Once Branching Programs Cook, Stephen et al. 2016
17 The Landscape of Communication Complexity Classes Göös, Mika et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 17


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI