No. |
Title |
Author |
Year |
---|

1 |
Algebraic Branching Programs, Border Complexity, and Tangent Spaces |
BlĂ¤ser, Markus et al. |
2020 |

2 |
Hard QBFs for Merge Resolution |
Beyersdorff, Olaf et al. |
2020 |

3 |
SAT and Interactions (Dagstuhl Seminar 20061) |
Beyersdorff, Olaf et al. |
2020 |

4 |
Building Strategies into QBF Proofs |
Beyersdorff, Olaf et al. |
2019 |

5 |
Lower Bound Techniques for QBF Proof Systems |
Mahajan, Meena |
2018 |

6 |
Arithmetic Circuits: An Overview (Invited Talk) |
Mahajan, Meena |
2017 |

7 |
Computing the Maximum using (min, +) Formulas |
Mahajan, Meena et al. |
2017 |

8 |
Are Short Proofs Narrow? QBF Resolution is not Simple |
Beyersdorff, Olaf et al. |
2016 |

9 |
Circuits, Logic and Games (Dagstuhl Seminar 15401) |
Bojanczyk, Mikolaj et al. |
2016 |

10 |
Understanding Cutting Planes for QBFs |
Beyersdorff, Olaf et al. |
2016 |

11 |
Homomorphism Polynomials Complete for VP |
Durand, Arnaud et al. |
2014 |

12 |
LIPIcs, Volume 8, FSTTCS'10, Complete Volume |
Lodaya, Kamal et al. |
2013 |

13 |
Frontmatter, Table of Contents, Preface, Conference Organization, Author Index |
Lodaya, Kamal et al. |
2010 |

14 |
Small space analogues of Valiant's classes and the limitations of skew formula |
Mahajan, Meena et al. |
2010 |