No. Title Author Year
1 A Unified Method for Placing Problems in Polylogarithmic Depth Krebs, Andreas et al. 2018
2 Better Complexity Bounds for Cost Register Automata Allender, Eric et al. 2017
3 On the Complexity of Bounded Context Switching Chini, Peter et al. 2017
4 Stone Duality and the Substitution Principle Borlido, CÚlia et al. 2017
5 Visibly Counter Languages and Constant Depth Circuits Krebs, Andreas et al. 2015
6 Bounds for the quantifier depth in finite-variable logics: Alternation hierarchy Berkholz, Christoph et al. 2013
7 DLOGTIME Proof Systems Krebs, Andreas et al. 2013
8 An effective characterization of the alternation hierarchy in two-variable logic Krebs, Andreas et al. 2012
Current Page :
Number of result pages: 1
Number of documents: 8


DROPS-Home | Fulltext Search | Imprint Published by LZI