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

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