No. Title Author Year
1 Computational Complexity of Discrete Problems (Dagstuhl Seminar 21121) Gál, Anna et al. 2021
2 On (Simple) Decision Tree Rank Dahiya, Yogesh et al. 2021
3 Algebraic Branching Programs, Border Complexity, and Tangent Spaces Bläser, Markus et al. 2020
4 Hard QBFs for Merge Resolution Beyersdorff, Olaf et al. 2020
5 SAT and Interactions (Dagstuhl Seminar 20061) Beyersdorff, Olaf et al. 2020
6 Building Strategies into QBF Proofs Beyersdorff, Olaf et al. 2019
7 Lower Bound Techniques for QBF Proof Systems Mahajan, Meena 2018
8 Arithmetic Circuits: An Overview (Invited Talk) Mahajan, Meena 2017
9 Computing the Maximum using (min, +) Formulas Mahajan, Meena et al. 2017
10 Are Short Proofs Narrow? QBF Resolution is not Simple Beyersdorff, Olaf et al. 2016
11 Circuits, Logic and Games (Dagstuhl Seminar 15401) Bojanczyk, Mikolaj et al. 2016
12 Understanding Cutting Planes for QBFs Beyersdorff, Olaf et al. 2016
13 Homomorphism Polynomials Complete for VP Durand, Arnaud et al. 2014
14 LIPIcs, Volume 8, FSTTCS'10, Complete Volume Lodaya, Kamal et al. 2013
15 Frontmatter, Table of Contents, Preface, Conference Organization, Author Index Lodaya, Kamal et al. 2010
16 Small space analogues of Valiant's classes and the limitations of skew formula Mahajan, Meena et al. 2010
Current Page :
Number of result pages: 1
Number of documents: 16


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