Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Klaus Meer
2010 – today
- 2013
[c29]- 2012
- [j29]Klaus Meer: On Ladner's result for a class of real machines with restricted use of constants. Inf. Comput. 210: 13-20 (2012)
- [j28]Klaus Meer: Some Initial Thoughts on Bounded Query Computations over the Reals. Int. J. Found. Comput. Sci. 23(7): 1499-1510 (2012)
- 2011
- [j27]Irénée Briquel, Pascal Koiran, Klaus Meer: On the expressive power of CNF formulas of bounded tree- and clique-width. Discrete Applied Mathematics 159(1): 1-14 (2011)
- [c28]Klaus Meer: An Extended Tree-Width Notion for Directed Graphs Related to the Computation of Permanents. CSR 2011: 247-260
- [c27]
- 2010
- [j26]
2000 – 2009
- 2009
- [j25]Klaus Meer, Dieter Rautenbach: On the OBDD size for graphs of bounded tree- and clique-width. Discrete Mathematics 309(4): 843-851 (2009)
- [j24]Klaus Meer, Martin Ziegler: Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation. Foundations of Computational Mathematics 9(5): 599-609 (2009)
- [c26]Klaus Meer: On Ladner's Result for a Class of Real Machines with Restricted Use of Constants. CiE 2009: 352-361
- 2008
- [j23]Klaus Meer, Martin Ziegler: An explicit solution to Post's Problem over the reals. J. Complexity 24(1): 3-15 (2008)
- [c25]Pascal Koiran, Klaus Meer: On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width. WG 2008: 252-263
- 2007
- [j22]Klaus Meer: Simulated Annealing versus Metropolis for a TSP instance. Inf. Process. Lett. 104(6): 216-219 (2007)
- [j21]Gregorio Malajovich, Klaus Meer: Computing Minimal Multi-Homogeneous Bezout Numbers Is Hard. Theory Comput. Syst. 40(4): 553-570 (2007)
- [j20]Klaus Meer: Some Relations between Approximation Problems and PCPs over the Real Numbers. Theory Comput. Syst. 41(1): 107-118 (2007)
- [c24]Marco Gori, Klaus Meer: Some Aspects of a Complexity Theory for Continuous Time Systems. CiE 2007: 554-565
- [c23]Klaus Meer, Martin Ziegler: Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation. MFCS 2007: 726-737
- 2006
- [j19]Uffe Flarup Hansen, Klaus Meer: Two logical hierarchies of optimization problems over the real numbers. Math. Log. Q. 52(1): 37-50 (2006)
- [c22]Klaus Meer: Optimization and Approximation Problems Related to Polynomial System Solving. CiE 2006: 360-367
- [c21]
- [c20]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
- [c19]Klaus Meer, Dieter Rautenbach: On the OBDD Size for Graphs of Bounded Tree- and Clique-Width. IWPEC 2006: 72-83
- [c18]Uffe Flarup Hansen, Klaus Meer: Approximation Classes for Real Number Optimization Problems. UC 2006: 86-100
- [e1]Thomas Lickteig, Klaus Meer, Luis Miguel Pardo (Eds.): Real Computation and Complexity, 1.-6. February 2004. Dagstuhl Seminar Proceedings 04061, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006
- [i3]Klaus Meer, Martin Ziegler: An Explicit Solution to Post's Problem over the Reals. CoRR abs/cs/0603071 (2006)
- [i2]Martin Ziegler, Klaus Meer: Real Computational Universality: The Word Problem for a class of groups with infinite presentation. CoRR abs/cs/0604032 (2006)
- 2005
- [j18]Klaus Meer: Probabilistically Checkable Proofs Over the Reals. Electr. Notes Theor. Comput. Sci. 123: 165-177 (2005)
- [j17]Klaus Meer: Transparent Long Proofs: A First PCP Theorem for NPR. Foundations of Computational Mathematics 5(3): 231-255 (2005)
- [c17]Klaus Meer: On Some Relations Between Approximation Problems and PCPs over the Real Numbers. CiE 2005: 322-331
- [c16]Klaus Meer, Martin Ziegler: An Explicit Solution to Post's Problem over the Reals. FCT 2005: 467-478
- [c15]Uffe Flarup Hansen, Klaus Meer: Two Logical Hierarchies of Optimization Problems over the Real Numbers. MFCS 2005: 459-470
- [c14]Gregorio Malajovich, Klaus Meer: Computing Minimal Multi-homogeneous Bézout Numbers Is Hard. STACS 2005: 244-255
- 2004
- [b1]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. Reliable Computing 10(3): 209-225 (2004)
- [c13]Thomas Lickteig, Klaus Meer, Luis Miguel Pardo: 04061 Summary - Real Computation and Complexity. Real Computation and Complexity 2004
- [c12]Thomas Lickteig, Klaus Meer, Luis Miguel Pardo: 04061 Abstracts Collection - Real Computation and Complexity. Real Computation and Complexity 2004
- [c11]Klaus Meer, Gregorio Malajovich: On the Complexity of Computing Multi-Homogeneous Bézout Numbers. Algorithms and Complexity for Continuous Problems 2004
- [c10]
- [c9]
- [i1]Gregorio Malajovich, Klaus Meer: Computing Multi-Homogeneous Bezout Numbers is Hard. CoRR cs.CC/0405021 (2004)
- 2003
- [c8]
- 2002
- [j15]Klaus Meer, Gerhard-Wilhelm Weber: Some aspects of studying an optimization or decision problem in different computational models. European Journal of Operational Research 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. Complexity 16(1): 324-332 (2000)
- [j12]
- [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]
- 1997
- [j8]Thomas Lickteig, Klaus Meer: Semi-algebraic Complexity--Additive Complexity of Matrix Computational Tasks. J. Complexity 13(1): 83-107 (1997)
- [c4]Felipe Cucker, Klaus Meer: Logics Which Capture Complexity Classes over the Reals. FCT 1997: 157-167
- [c3]
- 1996
- [c2]
- 1995
- [j7]
- [j6]Klaus Meer: On the Relations Between Discrete and Continuous Complexity Theory. Math. Log. Q. 41: 281-286 (1995)
- [c1]
- 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
- [j3]
- 1992
- [j2]Klaus Meer: A note on a P NP result for a restricted class of real machines. J. Complexity 8(4): 451-453 (1992)
- 1990
- [j1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:02 CEST by the dblp team