Klaus Meer

84 papers A* 2A 2B 12C 14Misc 4Journal 38Unranked 8
YearRankTypeTitle / Venue / Authors
2025 C conf
Some Structural Complexity Results for $\exists {\mathbb {R}}$.
CiE
Klaus Meer, Adrian Wurm
2025 J jnl
Some structural complexity results for ∃ℝ.
CoRR
Klaus Meer, Adrian Wurm
2024 — conf
Software Testing in Computable Analysis.
UCNC
Klaus Meer, Martin Ziegler
2021 Misc conf
A PCP of Proximity for Real Algebraic Polynomials.
CSR
Klaus Meer
2019 C conf
Automata over Infinite Sequences of Reals.
LATA
Klaus Meer, Ameen Naif
2019 J jnl
Interactive proofs and a Shamir-like result for real number computations.
Comput. Complex.
Martijn Baartse, Klaus Meer
2019 J jnl
Periodic generalized automata over the reals.
Inf. Comput.
Klaus Meer, Ameen Naif
2018 B ed.
Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings
WG
Andreas Brandstädt, Ekkehard Köhler, Klaus Meer
2017 J jnl
An algebraic proof of the real number PCP theorem.
J. Complex.
Martijn Baartse, Klaus Meer
2016 C conf
Periodic Generalized Automata over the Reals.
LATA
Klaus Meer, Ameen Naif
2016 B conf
Real Interactive Proofs for VPSPACE.
MFCS
Martijn Baartse, Klaus Meer
2015 — ed.
45. Jahrestagung der Gesellschaft für Informatik, Informatik, Energie und Umwelt, INFORMATIK 2015, Cottbus, Germany, September 28 - October 2, 2015
GI-Jahrestagung
Douglas W. Cunningham, Petra Hofstedt, Klaus Meer, Ingo Schmitt
2015 — conf
An Algebraic Proof of the Real Number PCP Theorem.
MFCS (2)
Martijn Baartse, Klaus Meer
2015 J jnl
Generalized finite automata over real and complex numbers.
Theor. Comput. Sci.
Klaus Meer, Ameen Naif
2015 C conf
Some Results on Interactive Proofs for Real Computations.
CiE
Martijn Baartse, Klaus Meer
2015 J jnl
The PCP Theorem for NP Over the Reals.
Found. Comput. Math.
Martijn Baartse, Klaus Meer
2014 J jnl
An Extended Tree-Width Notion for Directed Graphs Related to the Computation of Permanents.
Theory Comput. Syst.
Klaus Meer
2014 C conf
Generalized Finite Automata over Real and Complex Numbers.
TAMC
Klaus Meer, Ameen Naif
2014 C ed.
Language, Life, Limits - 10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014. Proceedings
CiE
Arnold Beckmann, Erzsébet Csuhaj-Varjú, Klaus Meer
2014 Misc conf
Testing Low Degree Trigonometric Polynomials.
CSR
Martijn Baartse, Klaus Meer
2013 A conf
The PCP theorem for NP over the reals.
STACS
Martijn Baartse, Klaus Meer
2012 J jnl
On Ladner's result for a class of real machines with restricted use of constants.
Inf. Comput.
Klaus Meer
2012 J jnl
Some Initial Thoughts on Bounded Query Computations over the Reals.
Int. J. Found. Comput. Sci.
Klaus Meer
2011 B conf
Almost Transparent Short Proofs for NPℝ.
FCT
Klaus Meer
2011 Misc conf
An Extended Tree-Width Notion for Directed Graphs Related to the Computation of Permanents.
CSR
Klaus Meer
2011 J jnl
On the expressive power of CNF formulas of bounded tree- and clique-width.
Discret. Appl. Math.
Irénée Briquel, Pascal Koiran, Klaus Meer
2010 J jnl
Tree-width in Algebraic Complexity.
Fundam. Informaticae
Klaus Meer
2009 C conf
On Ladner's Result for a Class of Real Machines with Restricted Use of Constants.
CiE
Klaus Meer
2009 J jnl
On the OBDD size for graphs of bounded tree- and clique-width.
Discret. Math.
Klaus Meer, Dieter Rautenbach
2009 J jnl
Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation.
Found. Comput. Math.
Klaus Meer, Martin Ziegler
2008 J jnl
An explicit solution to Post's Problem over the reals.
J. Complex.
Klaus Meer, Martin Ziegler
2008 B conf
On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width.
WG
Pascal Koiran, Klaus Meer
2007 J jnl
Computing Minimal Multi-Homogeneous Bezout Numbers Is Hard.
Theory Comput. Syst.
Gregorio Malajovich, Klaus Meer
2007 B conf
Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation.
MFCS
Klaus Meer, Martin Ziegler
2007 J jnl
Simulated Annealing versus Metropolis for a TSP instance.
Inf. Process. Lett.
Klaus Meer
2007 C conf
Some Aspects of a Complexity Theory for Continuous Time Systems.
CiE
Marco Gori, Klaus Meer
2007 J jnl
Some Relations between Approximation Problems and PCPs over the Real Numbers.
Theory Comput. Syst.
Klaus Meer
2006 J jnl
An Explicit Solution to Post's Problem over the Reals
CoRR
Klaus Meer, Martin Ziegler
2006 C conf
Approximation Classes for Real Number Optimization Problems.
UC
Uffe Flarup Hansen, Klaus Meer
2006 — conf
On the OBDD Size for Graphs of Bounded Tree- and Clique-Width.
IWPEC
Klaus Meer, Dieter Rautenbach
2006 C conf
Optimization and Approximation Problems Related to Polynomial System Solving.
CiE
Klaus Meer
2006 — ed.
Real Computation and Complexity, 1.-6. February 2004
Real Computation and Complexity
Thomas Lickteig, Klaus Meer, Luis Miguel Pardo
2006 J jnl
Real Computational Universality: The Word Problem for a class of groups with infinite presentation
CoRR
Martin Ziegler, Klaus Meer
2006 — conf
Real Computational Universality: The Word Problem for a class of groups with infinite presentation.
Algorithms and Complexity for Continuous Problems
Klaus Meer, Martin Ziegler
2006 J jnl
Two logical hierarchies of optimization problems over the real numbers.
Math. Log. Q.
Uffe Flarup Hansen, Klaus Meer
2006 C conf
Uncomputability Below the Real Halting Problem.
CiE
Klaus Meer, Martin Ziegler
2005 B conf
An Explicit Solution to Post's Problem over the Reals.
FCT
Klaus Meer, Martin Ziegler
2005 A conf
Computing Minimal Multi-homogeneous Bézout Numbers Is Hard.
STACS
Gregorio Malajovich, Klaus Meer
2005 C conf
On Some Relations Between Approximation Problems and PCPs over the Real Numbers.
CiE
Klaus Meer
2005 J jnl
Transparent Long Proofs: A First PCP Theorem for NP
Found. Comput. Math.
Klaus Meer
2005 B conf
Two Logical Hierarchies of Optimization Problems over the Real Numbers.
MFCS
Uffe Flarup Hansen, Klaus Meer
2004 — conf
04061 Abstracts Collection - Real Computation and Complexity.
Real Computation and Complexity
Thomas Lickteig, Klaus Meer, Luis Miguel Pardo
2004 — conf
04061 Summary - Real Computation and Complexity.
Real Computation and Complexity
Thomas Lickteig, Klaus Meer, Luis Miguel Pardo
2004 J jnl
Computing Multi-Homogeneous Bezout Numbers is Hard
CoRR
Gregorio Malajovich, Klaus Meer
2004 J jnl
On a Refined Analysis of Some Problems in Interval Arithmetic Using Real Number Complexity Theory.
Reliab. Comput.
Klaus Meer
2004 — conf
On the Approximation of Interval Functions.
PARA
Klaus Meer
2004 — conf
On the Complexity of Computing Multi-Homogeneous Bézout Numbers.
Algorithms and Complexity for Continuous Problems
Klaus Meer, Gregorio Malajovich
2004 — book
Optimization theory.
Hubertus Th. Jongen, Klaus Meer, Eberhard Triesch
2004 C conf
Probabilistically Checkable Proofs Over the Reals.
WoLLIC
Klaus Meer
2004 A* conf
Transparent Long Proofs: A First PCP Theorem for NP
ICALP
Klaus Meer
2003 B conf
On the Complexity of Some Problems in Interval Arithmetic.
MFCS
Klaus Meer
2002 J jnl
A Step towards a Complexity Theory for Analog Systems.
Math. Log. Q.
Marco Gori, Klaus Meer
2002 Misc conf
On Consistency and Width Notions for Constraint Programs with Algebraic Constraints.
FLOPS
Klaus Meer
2002 J jnl
Some aspects of studying an optimization or decision problem in different computational models.
Eur. J. Oper. Res.
Klaus Meer, Gerhard-Wilhelm Weber
2000 J jnl
A Note on Non-complete Problems in NPImage.
J. Complex.
Shai Ben-David, Klaus Meer, Christian Michaux
2000 J jnl
Counting problems over the reals.
Theor. Comput. Sci.
Klaus Meer
2000 B conf
On the Complexity of Combinatorial and Metafinite Generating Functions of Graph Properties in the Computational Model of Blum, Shub and Smale.
CSL
Johann A. Makowsky, Klaus Meer
1999 J jnl
Logics Which Capture Complexity Classes Over The Reals.
J. Symb. Log.
Felipe Cucker, Klaus Meer
1999 J jnl
On the computational structure of the connected components of a hard problem.
Inf. Process. Lett.
Martín Matamala, Klaus Meer
1999 B conf
Query Languages for Real Number Databases Based on Descriptive Complexity over R.
MFCS
Klaus Meer
1998 J jnl
On the Structure of NP_C.
SIAM J. Comput.
Gregorio Malajovich, Klaus Meer
1997 B conf
Counting Problems over the Reals.
MFCS
Klaus Meer
1997 B conf
Logics Which Capture Complexity Classes over the Reals.
FCT
Felipe Cucker, Klaus Meer
1997 J jnl
Semi-algebraic Complexity--Additive Complexity of Matrix Computational Tasks.
J. Complex.
Thomas Lickteig, Klaus Meer
1996 C conf
On diagonal sets in uncountable structures.
CCA
Klaus Meer
1995 J jnl
A Note on Testing the Resultant.
J. Complex.
Thomas Lickteig, Klaus Meer
1995 A* conf
Descriptive complexity theory over the real numbers.
STOC
Erich Grädel, Klaus Meer
1995 J jnl
On the Relations Between Discrete and Continuous Complexity Theory.
Math. Log. Q.
Klaus Meer
1994 J jnl
On the Complexity of Quadratic Programming in Real Number Models of Computation.
Theor. Comput. Sci.
Klaus Meer
1994 J jnl
Real Number Computations: On the Use of Information.
J. Symb. Comput.
Klaus Meer
1993 — —
Komplexitätsbetrachtungen für reelle Maschinenmodelle.
Klaus Meer
1993 J jnl
Real Number Models under Various Sets of Operations.
J. Complex.
Klaus Meer
1992 J jnl
A note on a
J. Complex.
Klaus Meer
1990 J jnl
Computations over Z and R: A comparison.
J. Complex.
Klaus Meer