A survey on real structural complexity theory
K Meer, C Michaux - Bulletin of the Belgian Mathematical Society …, 1997 - projecteuclid.org
A survey on real structural complexity theory Page 1 A survey on real structural complexity
theory Klaus Meer ∗ Christian Michaux † Abstract In this tutorial paper we overview research …
theory Klaus Meer ∗ Christian Michaux † Abstract In this tutorial paper we overview research …
On the structure of Valiant's complexity classes
P Bürgisser - Discrete Mathematics & Theoretical Computer …, 1999 - dmtcs.episciences.org
In Valiant developed an algebraic analogue of the theory of NP-completeness for
computations of polynomials over a field. We further develop this theory in the spirit of …
computations of polynomials over a field. We further develop this theory in the spirit of …
Saturation and stability in the theory of computation over the reals
This paper was motivated by the following two questions which arise in the theory of
complexity for computation over ordered rings in the now famous computational model …
complexity for computation over ordered rings in the now famous computational model …
Some structural complexity results for
K Meer, A Wurm - arxiv preprint arxiv:2502.00680, 2025 - arxiv.org
The complexity class $\exists\mathbb R $, standing for the complexity of deciding the
existential first order theory of the reals as real closed field in the Turing model, has raised …
existential first order theory of the reals as real closed field in the Turing model, has raised …
An explicit solution to Post's Problem over the reals
K Meer, M Ziegler - Journal of Complexity, 2008 - Elsevier
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) …
decidable language to be undecidable yet not reducible from (and thus strictly easier than) …
A note on non-complete problems in NPR
This note deals with the structure of the class NPR introduced by L. Blum, M. Shub, and S.
Smale (1989, Bull. Amer. Math. Soc. 21, 1–46). It is shown that, assuming NPR⊈ PR/poly …
Smale (1989, Bull. Amer. Math. Soc. 21, 1–46). It is shown that, assuming NPR⊈ PR/poly …
An explicit solution to Post's problem over the reals
K Meer, M Ziegler - … of Computation Theory: 15th International Symposium …, 2005 - Springer
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) …
decidable language to be undecidable yet not reducible from (and thus strictly easier than) …
Some aspects of studying an optimization or decision problem in different computational models
K Meer, GW Weber - European Journal of Operational Research, 2002 - Elsevier
In this paper we want to discuss some of the features coming up when analyzing a problem
in different complexity theoretic frameworks. The focus will be on two problems. The first is …
in different complexity theoretic frameworks. The focus will be on two problems. The first is …
The Structure of Valiant's Complexity Classes
P Bürgisser, P Bürgisser - … and Reduction in Algebraic Complexity Theory, 2000 - Springer
5 The Structure of Valiant's Complexity Classes Page 1 5 The Structure of Valiant's Complexity
Classes We further develop our theory in the spirit of structural complexity and obtain analogues …
Classes We further develop our theory in the spirit of structural complexity and obtain analogues …
Topics in real and complex number complexity theory
M Baartse, K Meer - Recent Advances in Real Complexity and …, 2012 - books.google.com
The paper intends to introduce into topics relevant in real and complex number complexity
theory. This is done in a survey style. Taking as starting point the computational model …
theory. This is done in a survey style. Taking as starting point the computational model …