#### Filter Results:

- Full text PDF available (15)

#### Publication Year

1983

2007

- This year (0)
- Last 5 years (0)
- Last 10 years (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Clemens Lautemann
- Inf. Process. Lett.
- 1983

We start with some definitions about probabilistic Turing machines (for a detailed exposition of this subject the reader is referred to [2]). Our basic model of computation is the Turing machine with input alphabet S z (0, l}. All machines are assumed to have two terminal states, namely q0 (reject) and 9, (accept). A probabilistic Turing machine (PTM) is… (More)

Erklärung Hiermit versichere ich, dass ich die vorliegende Masterarbeit selbstständig verfasst und keine anderen Quellen und Hilfsmittel als die angegebenen benutzt habe.

- Ulrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer, Klaus W. Wagner
- Structure in Complexity Theory Conference
- 1993

- David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thérien
- J. Comput. Syst. Sci.
- 2005

A language L over an alphabet A is said to have a neutral letter if there is a letter e ∈ A such that inserting or deleting e’s from any word in A∗ does not change its membership or non-membership in L. The presence of a neutral letter affects the definability of a language in firstorder logic. It was conjectured that it renders all numerical predicates… (More)

- Dieter Hofbauer, Clemens Lautemann
- RTA
- 1989

- Arnaud Durand, Clemens Lautemann, Thomas Schwentick
- J. Log. Comput.
- 1998

- Clemens Lautemann
- Acta Informatica
- 1990

Although in many ways, hyperedge replacement graph grammars (HRGs) are, among all graph generating mechanisms, what context-free Chomsky grammars are in the realm of string rewriting, their parsing problem is known to be, in general, NP-complete. In this paper, the main difficulty in HRG parsing is analysed and some conditions on either grammar or input… (More)

- Michal Koucký, Clemens Lautemann, Sebastian Poloczek, Denis Thérien
- 21st Annual IEEE Conference on Computational…
- 2006

In this paper we prove that the class of functions expressible by first order formulas with only two variables coincides with the class of functions computable by AC<sup>0</sup> circuits with a linear number of gates. We then investigate the feasibility of using Ehrenfeucht-Fraisse games to prove lower bounds for that class of circuits, as well as for… (More)

- Clemens Lautemann
- ICALP
- 1988

- Arnaud Durand, Clemens Lautemann, Malika More
- Circuits, Logic, and Games
- 2006

The counting ability of weak formalisms is of interest as a measure of their expressive power. The question was investigated in several papers in complexity theory [ABO84,FKPS85,DGS86] and in weak arithmetic [PW87]. In each case, the considered formalism (AC0{circuits, rst{order logic, 0, respectively) was shown to be able to count precisely up to a… (More)