#### Filter Results:

#### Publication Year

1990

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Klaus Meer
- MFCS
- 1997

- Erich Grädel, Klaus Meer
- STOC
- 1995

We present a logical approach to complexity over the real numbers with respect to the model of Blum, Shub and Smale. The Iogics under consideration are interpreted over a special class of two-sorted structures, called R-structures They consist of a finite structure together with the ordered field of reals and a finite set of functions from the finite… (More)

- Klaus Meer, Martin Ziegler
- FCT
- 2005

In the BSS model of real number computations we prove a concrete and explicit semi-decidable language to be undecidable yet not reducible from (and thus strictly easier than) the real Halting Language. This solution to Post's Problem over the reals significantly differs from its classical, discrete variant where advanced diagonalization techniques are only… (More)

- Klaus Meer
- Theor. Comput. Sci.
- 1994

In this tutorial paper we overview research being done in the field of structural complexity and recursion theory over the real numbers and other domains following the approach by Blum, Shub, and Smale [12].

- Klaus Meer
- Inf. Process. Lett.
- 2007

- Klaus Meer
- J. Complexity
- 1992

- Klaus Meer
- J. Complexity
- 1993

- Pascal Koiran, Klaus Meer
- WG
- 2008

Starting point of our work is a previous paper by Flarup, Koiran, and Lyaudet [5]. There the expressive power of certain families of polynomials is investigated. Among other things it is shown that polynomials arising as permanents of bounded tree-width matrices have the same expressiveness as polynomials given via arithmetic formulas. A natural question is… (More)

- Klaus Meer, Dieter Rautenbach
- Discrete Mathematics
- 2006

We study the size of OBDDs (ordered binary decision diagrams) for representing the adjacency function fG of a graph G on n vertices. Our results are as follows:-for graphs of bounded tree-width there is an OBDD of size O(log n) for fG that uses encodings of size O(log n) for the vertices;-for graphs of bounded clique-width there is an OBDD of size O(n) for… (More)