Abstract Measures of
Low-Level Computational Complexity

Outputs

AMLLCC Outputs


journal articles

green triangle Corrected Upper Bounds for Free-Cut Elimination,
A. Beckmann and S.R.Buss. TCS 2011, 412(39): 5433-5445.
green triangle Characterising Definable Search Problems in Bounded Arithmetic via Proof Notations,
A. Beckmann and S.R.Buss. In: Ways of Proof Theory, ed. R. Schindler, Ontos Series on Mathematical Logic, pp. 65-134, 2010.
green triangle On the computational complexity of cut-reduction,
A. Beckmann and K. Aehlig. Ann.Pure.Appl.Logic 2010, 161: 711-736.
green triangle Polynomial Local Search in the Polynomial Hierarchy and Witnessing in Fragments of Bounded Arithmetic,
A. Beckmann and S.R.Buss. Journal of Mathematical Logic 2009, 9(1): 103-138.
green triangle Parameter-Free Polymorphic Types,
K. Aehlig.  APAL 2008, 156 (1): 3-12.
green triangle Normalization by Evaluation for Martin-Löf Type Theory with One Universe,
A. Abel, K. Aehlig and P. Dybier.  ENTCS 2007, 173: 17-39.
green triangle A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata,
K. Aehlig.  LMCS 2007, 3 (3:1): 1-23.


conference papers

green triangle A Characterisation of Definable NP Search Problems in Peano Arithmetic,
A. Beckmann. WoLLIC 2009
green triangle On the complexity of parity games,
A. Beckmann and F. G. Moller. Visions of Computer Science 2008
green triangle On the computational complexity of cut-reduction,
A. Beckmann and K. Aehlig. LICS 2008
green triangle A Compiled Implementation of Normalization by Evaluation,
K. Aehlig, F. Haftmann and T. Nipkow.  TPHOLs 2008.
green triangle Propositional Logic for Circuit Classes,
A. Beckmann and K. Aehlig, CSL 2007.

websites: Arnold Beckmann 2014-03-17 Valid HTML 4.01! Valid CSS!