default search action
Klaus Meer
Person information
- affiliation: Brandenburg University of Technology, Cottbus, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c35]Klaus Meer, Martin Ziegler:
Software Testing in Computable Analysis. UCNC 2024: 58-73 - 2021
- [c34]Klaus Meer:
A PCP of Proximity for Real Algebraic Polynomials. CSR 2021: 264-282
2010 – 2019
- 2019
- [j34]Martijn Baartse, Klaus Meer:
Interactive proofs and a Shamir-like result for real number computations. Comput. Complex. 28(3): 437-469 (2019) - [j33]Klaus Meer, Ameen Naif:
Periodic generalized automata over the reals. Inf. Comput. 269 (2019) - [c33]Klaus Meer, Ameen Naif:
Automata over Infinite Sequences of Reals. LATA 2019: 121-133 - 2018
- [e4]Andreas Brandstädt, Ekkehard Köhler, Klaus Meer:
Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings. Lecture Notes in Computer Science 11159, Springer 2018, ISBN 978-3-030-00255-8 [contents] - 2017
- [j32]Martijn Baartse, Klaus Meer:
An algebraic proof of the real number PCP theorem. J. Complex. 40: 34-77 (2017) - 2016
- [c32]Klaus Meer, Ameen Naif:
Periodic Generalized Automata over the Reals. LATA 2016: 168-180 - [c31]Martijn Baartse, Klaus Meer:
Real Interactive Proofs for VPSPACE. MFCS 2016: 14:1-14:13 - 2015
- [j31]Martijn Baartse, Klaus Meer:
The PCP Theorem for NP Over the Reals. Found. Comput. Math. 15(3): 651-680 (2015) - [j30]Klaus Meer, Ameen Naif:
Generalized finite automata over real and complex numbers. Theor. Comput. Sci. 591: 85-98 (2015) - [c30]Martijn Baartse, Klaus Meer:
Some Results on Interactive Proofs for Real Computations. CiE 2015: 107-116 - [c29]Martijn Baartse, Klaus Meer:
An Algebraic Proof of the Real Number PCP Theorem. MFCS (2) 2015: 50-61 - [e3]Douglas W. Cunningham, Petra Hofstedt, Klaus Meer, Ingo Schmitt:
45. Jahrestagung der Gesellschaft für Informatik, Informatik, Energie und Umwelt, INFORMATIK 2015, Cottbus, Germany, September 28 - October 2, 2015. LNI P-246, GI 2015, ISBN 978-3-88579-640-4 [contents] - 2014
- [j29]Klaus Meer:
An Extended Tree-Width Notion for Directed Graphs Related to the Computation of Permanents. Theory Comput. Syst. 55(2): 330-346 (2014) - [c28]Martijn Baartse, Klaus Meer:
Testing Low Degree Trigonometric Polynomials. CSR 2014: 77-96 - [c27]Klaus Meer, Ameen Naif:
Generalized Finite Automata over Real and Complex Numbers. TAMC 2014: 168-187 - [e2]Arnold Beckmann, Erzsébet Csuhaj-Varjú, Klaus Meer:
Language, Life, Limits - 10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014. Proceedings. Lecture Notes in Computer Science 8493, Springer 2014, ISBN 978-3-319-08018-5 [contents] - 2013
- [c26]Martijn Baartse, Klaus Meer:
The PCP theorem for NP over the reals. STACS 2013: 104-115 - 2012
- [j28]Klaus Meer:
On Ladner's result for a class of real machines with restricted use of constants. Inf. Comput. 210: 13-20 (2012) - [j27]Klaus Meer:
Some Initial Thoughts on Bounded Query Computations over the Reals. Int. J. Found. Comput. Sci. 23(7): 1499-1510 (2012) - 2011
- [j26]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): 1-14 (2011) - [c25]Klaus Meer:
An Extended Tree-Width Notion for Directed Graphs Related to the Computation of Permanents. CSR 2011: 247-260 - [c24]Klaus Meer:
Almost Transparent Short Proofs for NPℝ. FCT 2011: 41-52 - 2010
- [j25]Klaus Meer:
Tree-width in Algebraic Complexity. Fundam. Informaticae 98(4): 391-409 (2010)
2000 – 2009
- 2009
- [j24]Klaus Meer, Dieter Rautenbach:
On the OBDD size for graphs of bounded tree- and clique-width. Discret. Math. 309(4): 843-851 (2009) - [j23]Klaus Meer, Martin Ziegler:
Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation. Found. Comput. Math. 9(5): 599-609 (2009) - [c23]Klaus Meer:
On Ladner's Result for a Class of Real Machines with Restricted Use of Constants. CiE 2009: 352-361 - 2008
- [j22]Klaus Meer, Martin Ziegler:
An explicit solution to Post's Problem over the reals. J. Complex. 24(1): 3-15 (2008) - [c22]Pascal Koiran, Klaus Meer:
On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width. WG 2008: 252-263 - 2007
- [j21]Klaus Meer:
Simulated Annealing versus Metropolis for a TSP instance. Inf. Process. Lett. 104(6): 216-219 (2007) - [j20]Gregorio Malajovich
, Klaus Meer:
Computing Minimal Multi-Homogeneous Bezout Numbers Is Hard. Theory Comput. Syst. 40(4): 553-570 (2007) - [j19]Klaus Meer:
Some Relations between Approximation Problems and PCPs over the Real Numbers. Theory Comput. Syst. 41(1): 107-118 (2007) - [c21]Marco Gori, Klaus Meer:
Some Aspects of a Complexity Theory for Continuous Time Systems. CiE 2007: 554-565 - [c20]Klaus Meer, Martin Ziegler:
Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation. MFCS 2007: 726-737 - 2006
- [j18]Uffe Flarup Hansen, Klaus Meer:
Two logical hierarchies of optimization problems over the real numbers. Math. Log. Q. 52(1): 37-50 (2006) - [c19]Klaus Meer:
Optimization and Approximation Problems Related to Polynomial System Solving. CiE 2006: 360-367 - [c18]Klaus Meer, Martin Ziegler:
Uncomputability Below the Real Halting Problem. CiE 2006: 368-377 - [c17]Klaus Meer, Dieter Rautenbach:
On the OBDD Size for Graphs of Bounded Tree- and Clique-Width. IWPEC 2006: 72-83 - [c16]Uffe Flarup Hansen, Klaus Meer:
Approximation Classes for Real Number Optimization Problems. UC 2006: 86-100 - [e1]Thomas Lickteig, Klaus Meer, Luis Miguel Pardo:
Real Computation and Complexity, 1.-6. February 2004. Dagstuhl Seminar Proceedings 04061, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - [i7]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 - [i6]Klaus Meer, Martin Ziegler:
An Explicit Solution to Post's Problem over the Reals. CoRR abs/cs/0603071 (2006) - [i5]Martin Ziegler, Klaus Meer:
Real Computational Universality: The Word Problem for a class of groups with infinite presentation. CoRR abs/cs/0604032 (2006) - 2005
- [j17]Klaus Meer:
Transparent Long Proofs: A First PCP Theorem for NPR. Found. Comput. Math. 5(3): 231-255 (2005) - [c15]Klaus Meer:
On Some Relations Between Approximation Problems and PCPs over the Real Numbers. CiE 2005: 322-331 - [c14]Klaus Meer, Martin Ziegler:
An Explicit Solution to Post's Problem over the Reals. FCT 2005: 467-478 - [c13]Uffe Flarup Hansen, Klaus Meer:
Two Logical Hierarchies of Optimization Problems over the Real Numbers. MFCS 2005: 459-470 - [c12]Gregorio Malajovich
Computing Minimal Multi-homogeneous Bézout Numbers Is Hard. STACS 2005: 244-255 - 2004
- [b2]Hubertus Th. Jongen, Klaus Meer, Eberhard Triesch:
Optimization theory. Kluwer 2004, ISBN 978-1-4020-8098-2, pp. I-XI, 1-443 - [j16]Klaus Meer:
On a Refined Analysis of Some Problems in Interval Arithmetic Using Real Number Complexity Theory. Reliab. Comput. 10(3): 209-225 (2004) - [c11]Klaus Meer:
Transparent Long Proofs: A First PCP Theorem for NPR. ICALP 2004: 959-970 - [c10]Klaus Meer:
On the Approximation of Interval Functions. PARA 2004: 169-178 - [c9]Klaus Meer:
Probabilistically Checkable Proofs Over the Reals. WoLLIC 2004: 165-177 - [i4]Thomas Lickteig, Klaus Meer, Luis Miguel Pardo:
04061 Summary - Real Computation and Complexity. Real Computation and Complexity 2004 - [i3]Thomas Lickteig, Klaus Meer, Luis Miguel Pardo:
04061 Abstracts Collection - Real Computation and Complexity. Real Computation and Complexity 2004 - [i2]Klaus Meer, Gregorio Malajovich:
On the Complexity of Computing Multi-Homogeneous Bézout Numbers. Algorithms and Complexity for Continuous Problems 2004 - [i1]Gregorio Malajovich, Klaus Meer:
Computing Multi-Homogeneous Bezout Numbers is Hard. CoRR cs.CC/0405021 (2004) - 2003
- [c8]Klaus Meer:
On the Complexity of Some Problems in Interval Arithmetic. MFCS 2003: 582-591 - 2002
- [j15]Klaus Meer, Gerhard-Wilhelm Weber
Some aspects of studying an optimization or decision problem in different computational models. Eur. J. Oper. Res. 143(2): 406-418 (2002) - [j14]Marco Gori, Klaus Meer:
A Step towards a Complexity Theory for Analog Systems. Math. Log. Q. 48(S1): 45-58 (2002) - [c7]Klaus Meer:
On Consistency and Width Notions for Constraint Programs with Algebraic Constraints. FLOPS 2002: 88-102 - 2000
- [j13]Shai Ben-David, Klaus Meer, Christian Michaux
A Note on Non-complete Problems in NPImage. J. Complex. 16(1): 324-332 (2000) - [j12]Klaus Meer:
Counting problems over the reals. Theor. Comput. Sci. 242(1-2): 41-58 (2000) - [c6]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: 399-410
1990 – 1999
- 1999
- [j11]Martín Matamala, Klaus Meer:
On the computational structure of the connected components of a hard problem. Inf. Process. Lett. 72(3-4): 83-90 (1999) - [j10]Felipe Cucker, Klaus Meer:
Logics Which Capture Complexity Classes Over The Reals. J. Symb. Log. 64(1): 363-390 (1999) - [c5]Klaus Meer:
Query Languages for Real Number Databases Based on Descriptive Complexity over R. MFCS 1999: 12-22 - 1998
- [j9]Gregorio Malajovich
On the Structure of NP_C. SIAM J. Comput. 28(1): 27-35 (1998) - 1997
- [j8]Thomas Lickteig, Klaus Meer:
Semi-algebraic Complexity--Additive Complexity of Matrix Computational Tasks. J. Complex. 13(1): 83-107 (1997) - [c4]Felipe Cucker
Logics Which Capture Complexity Classes over the Reals. FCT 1997: 157-167 - [c3]Klaus Meer:
Counting Problems over the Reals. MFCS 1997: 398-407 - 1996
- [c2]Klaus Meer:
On diagonal sets in uncountable structures. CCA 1996 - 1995
- [j7]Thomas Lickteig, Klaus Meer:
A Note on Testing the Resultant. J. Complex. 11(3): 344-351 (1995) - [j6]Klaus Meer:
On the Relations Between Discrete and Continuous Complexity Theory. Math. Log. Q. 41: 281-286 (1995) - [c1]Erich Grädel, Klaus Meer:
Descriptive complexity theory over the real numbers. STOC 1995: 315-324 - 1994
- [j5]Klaus Meer:
Real Number Computations: On the Use of Information. J. Symb. Comput. 18(3): 199-206 (1994) - [j4]Klaus Meer:
On the Complexity of Quadratic Programming in Real Number Models of Computation. Theor. Comput. Sci. 133(1): 85-84 (1994) - 1993
- [b1]Klaus Meer:
Komplexitätsbetrachtungen für reelle Maschinenmodelle. RWTH Aachen University, Germany, Shaker 1993, ISBN 978-3-86111-385-0, pp. 1-105 - [j3]Klaus Meer:
Real Number Models under Various Sets of Operations. J. Complex. 9(3): 366-372 (1993) - 1992
- [j2]Klaus Meer:
A note on a P NP result for a restricted class of real machines. J. Complex. 8(4): 451-453 (1992) - 1990
- [j1]Klaus Meer:
Computations over Z and R: A comparison. J. Complex. 6(3): 256-263 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-05 01:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: