Klaus Meer

Publication Activity (10 Years)

Years Active: 1990-2024
Publications (10 Years): 8

Top Venues

CSR

LATA

Theory Comput. Syst.

TAMC

RWTH Aachen University, Germany (PHD)

Education History

RWTH Aachen University, Germany

PHD

Publications

Klaus Meer, Martin Ziegler
Software Testing in Computable Analysis. UCNC (2024)
Klaus Meer
A PCP of Proximity for Real Algebraic Polynomials. CSR (2021)
Martijn Baartse, Klaus Meer
Interactive proofs and a Shamir-like result for real number computations. Comput. Complex. 28 (3) (2019)
Klaus Meer, Ameen Naif
Periodic generalized automata over the reals. Inf. Comput. 269 (2019)
Klaus Meer, Ameen Naif
Automata over Infinite Sequences of Reals. LATA (2019)
Martijn Baartse, Klaus Meer
An algebraic proof of the real number PCP theorem. J. Complex. 40 (2017)
Martijn Baartse, Klaus Meer
Real Interactive Proofs for VPSPACE. MFCS (2016)
Klaus Meer, Ameen Naif
Periodic Generalized Automata over the Reals. LATA (2016)
Martijn Baartse, Klaus Meer
Some Results on Interactive Proofs for Real Computations. CiE (2015)
Klaus Meer, Ameen Naif
Generalized finite automata over real and complex numbers. Theor. Comput. Sci. 591 (2015)
Martijn Baartse, Klaus Meer
The PCP Theorem for NP Over the Reals. Found. Comput. Math. 15 (3) (2015)
Martijn Baartse, Klaus Meer
An Algebraic Proof of the Real Number PCP Theorem. MFCS (2) (2015)
Klaus Meer
An Extended Tree-Width Notion for Directed Graphs Related to the Computation of Permanents. Theory Comput. Syst. 55 (2) (2014)
Klaus Meer, Ameen Naif
Generalized Finite Automata over Real and Complex Numbers. TAMC (2014)
Martijn Baartse, Klaus Meer
Testing Low Degree Trigonometric Polynomials. CSR (2014)
Martijn Baartse, Klaus Meer
The PCP theorem for NP over the reals. STACS (2013)
Klaus Meer
Some Initial Thoughts on Bounded Query Computations over the Reals. Int. J. Found. Comput. Sci. 23 (7) (2012)
Klaus Meer
On Ladner's result for a class of real machines with restricted use of constants. Inf. Comput. 210 (2012)
Irénée Briquel, Pascal Koiran, Klaus Meer
On the expressive power of CNF formulas of bounded tree- and clique-width. Discret. Appl. Math. 159 (1) (2011)
Klaus Meer
Almost Transparent Short Proofs for NPℝ. FCT (2011)
Klaus Meer
An Extended Tree-Width Notion for Directed Graphs Related to the Computation of Permanents. CSR (2011)
Klaus Meer
Tree-width in Algebraic Complexity. Fundam. Informaticae 98 (4) (2010)
Klaus Meer
On Ladner's Result for a Class of Real Machines with Restricted Use of Constants. CiE (2009)
Klaus Meer, Dieter Rautenbach
On the OBDD size for graphs of bounded tree- and clique-width. Discret. Math. 309 (4) (2009)
Klaus Meer, Martin Ziegler
Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation. Found. Comput. Math. 9 (5) (2009)
Klaus Meer, Martin Ziegler
An explicit solution to Post's Problem over the reals. J. Complex. 24 (1) (2008)
Pascal Koiran, Klaus Meer
On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width. WG (2008)
Marco Gori, Klaus Meer
Some Aspects of a Complexity Theory for Continuous Time Systems. CiE (2007)
Klaus Meer
Simulated Annealing versus Metropolis for a TSP instance. Inf. Process. Lett. 104 (6) (2007)
Gregorio Malajovich, Klaus Meer
Computing Minimal Multi-Homogeneous Bezout Numbers Is Hard. Theory Comput. Syst. 40 (4) (2007)
Klaus Meer, Martin Ziegler
Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation. MFCS (2007)
Klaus Meer
Some Relations between Approximation Problems and PCPs over the Real Numbers. Theory Comput. Syst. 41 (1) (2007)
Uffe Flarup Hansen, Klaus Meer
Two logical hierarchies of optimization problems over the real numbers. Math. Log. Q. 52 (1) (2006)
Klaus Meer, Martin Ziegler
An Explicit Solution to Post's Problem over the Reals CoRR (2006)
Klaus Meer, Martin Ziegler
Real Computational Universality: The Word Problem for a class of groups with infinite presentation. Algorithms and Complexity for Continuous Problems (2006)
Klaus Meer, Martin Ziegler
Uncomputability Below the Real Halting Problem. CiE (2006)
Klaus Meer
Optimization and Approximation Problems Related to Polynomial System Solving. CiE (2006)
Klaus Meer, Dieter Rautenbach
On the OBDD Size for Graphs of Bounded Tree- and Clique-Width. IWPEC (2006)
Uffe Flarup Hansen, Klaus Meer
Approximation Classes for Real Number Optimization Problems. UC (2006)
Martin Ziegler, Klaus Meer
Real Computational Universality: The Word Problem for a class of groups with infinite presentation CoRR (2006)
Klaus Meer
. Found. Comput. Math. 5 (3) (2005)
Gregorio Malajovich, Klaus Meer
Computing Minimal Multi-homogeneous Bézout Numbers Is Hard. STACS (2005)
Klaus Meer, Martin Ziegler
An Explicit Solution to Post's Problem over the Reals. FCT (2005)
Uffe Flarup Hansen, Klaus Meer
Two Logical Hierarchies of Optimization Problems over the Real Numbers. MFCS (2005)
Klaus Meer
Probabilistically Checkable Proofs Over the Reals. Electron. Notes Theor. Comput. Sci. 123 (2005)
Klaus Meer
On Some Relations Between Approximation Problems and PCPs over the Real Numbers. CiE (2005)
Klaus Meer
On a Refined Analysis of Some Problems in Interval Arithmetic Using Real Number Complexity Theory. Reliab. Comput. 10 (3) (2004)
Gregorio Malajovich, Klaus Meer
Computing Multi-Homogeneous Bezout Numbers is Hard CoRR (2004)
Klaus Meer, Gregorio Malajovich
On the Complexity of Computing Multi-Homogeneous Bézout Numbers. Algorithms and Complexity for Continuous Problems (2004)
Thomas Lickteig, Klaus Meer, Luis Miguel Pardo
04061 Summary - Real Computation and Complexity. Real Computation and Complexity (2004)
Thomas Lickteig, Klaus Meer, Luis Miguel Pardo
04061 Abstracts Collection - Real Computation and Complexity. Real Computation and Complexity (2004)
Klaus Meer
. ICALP (2004)
Klaus Meer
On the Approximation of Interval Functions. PARA (2004)
Klaus Meer
On the Complexity of Some Problems in Interval Arithmetic. MFCS (2003)
Klaus Meer
On Consistency and Width Notions for Constraint Programs with Algebraic Constraints. FLOPS (2002)
Marco Gori, Klaus Meer
A Step towards a Complexity Theory for Analog Systems. Math. Log. Q. 48 (S1) (2002)
Klaus Meer, Gerhard-Wilhelm Weber
Some aspects of studying an optimization or decision problem in different computational models. Eur. J. Oper. Res. 143 (2) (2002)
Klaus Meer
Counting problems over the reals. Theor. Comput. Sci. 242 (1-2) (2000)
Shai Ben-David, Klaus Meer, Christian Michaux
A Note on Non-complete Problems in NPImage. J. Complex. 16 (1) (2000)
Johann A. Makowsky, Klaus Meer
On the Complexity of Combinatorial and Metafinite Generating Functions of Graph Properties in the Computational Model of Blum, Shub and Smale. CSL (2000)
Martín Matamala, Klaus Meer
On the computational structure of the connected components of a hard problem. Inf. Process. Lett. 72 (3-4) (1999)
Klaus Meer
Query Languages for Real Number Databases Based on Descriptive Complexity over R. MFCS (1999)
Felipe Cucker, Klaus Meer
Logics Which Capture Complexity Classes Over The Reals. J. Symb. Log. 64 (1) (1999)
Gregorio Malajovich, Klaus Meer
On the Structure of NP_C. SIAM J. Comput. 28 (1) (1998)
Thomas Lickteig, Klaus Meer
Semi-algebraic Complexity--Additive Complexity of Matrix Computational Tasks. J. Complex. 13 (1) (1997)
Klaus Meer
Counting Problems over the Reals. MFCS (1997)
Felipe Cucker, Klaus Meer
Logics Which Capture Complexity Classes over the Reals. FCT (1997)
Klaus Meer
On diagonal sets in uncountable structures. CCA (1996)
Klaus Meer
On the Relations Between Discrete and Continuous Complexity Theory. Math. Log. Q. 41 (1995)
Erich Grädel, Klaus Meer
Descriptive complexity theory over the real numbers. STOC (1995)
Thomas Lickteig, Klaus Meer
A Note on Testing the Resultant. J. Complex. 11 (3) (1995)
Klaus Meer
On the Complexity of Quadratic Programming in Real Number Models of Computation. Theor. Comput. Sci. 133 (1) (1994)
Klaus Meer
Real Number Computations: On the Use of Information. J. Symb. Comput. 18 (3) (1994)
Klaus Meer
Real Number Models under Various Sets of Operations. J. Complex. 9 (3) (1993)
Klaus Meer
result for a restricted class of real machines. J. Complex. 8 (4) (1992)
Klaus Meer
Computations over Z and R: A comparison. J. Complex. 6 (3) (1990)

Klaus Meer.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Klaus Meer