- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| 61 |      | Klaus Meer: On Ladner's result for a class of real machines with restricted use of constants. Inf. Comput. 210: 13-20 (2012) |
| 2011 | ||
| 60 | | Klaus Meer: An Extended Tree-Width Notion for Directed Graphs Related to the Computation of Permanents. CSR 2011: 247-260 |
| 59 | | Klaus Meer: Almost Transparent Short Proofs for NPℝ. FCT 2011: 41-52 |
| 58 | | 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) |
| 2010 | ||
| 57 | | Klaus Meer: Tree-width in Algebraic Complexity. Fundam. Inform. 98(4): 391-409 (2010) |
| 2009 | ||
| 56 | | Klaus Meer: On Ladner's Result for a Class of Real Machines with Restricted Use of Constants. CiE 2009: 352-361 |
| 55 | | Klaus Meer, Dieter Rautenbach: On the OBDD size for graphs of bounded tree- and clique-width. Discrete Mathematics 309(4): 843-851 (2009) |
| 54 | | 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) |
| 2008 | ||
| 53 | | Pascal Koiran, Klaus Meer: On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width. WG 2008: 252-263 |
| 52 | | Klaus Meer, Martin Ziegler: An explicit solution to Post's Problem over the reals. J. Complexity 24(1): 3-15 (2008) |
| 2007 | ||
| 51 | | Marco Gori, Klaus Meer: Some Aspects of a Complexity Theory for Continuous Time Systems. CiE 2007: 554-565 |
| 50 | | Klaus Meer, Martin Ziegler: Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation. MFCS 2007: 726-737 |
| 49 | | Klaus Meer: Simulated Annealing versus Metropolis for a TSP instance. Inf. Process. Lett. 104(6): 216-219 (2007) |
| 48 | | Gregorio Malajovich, Klaus Meer: Computing Minimal Multi-Homogeneous Bezout Numbers Is Hard. Theory Comput. Syst. 40(4): 553-570 (2007) |
| 47 | | Klaus Meer: Some Relations between Approximation Problems and PCPs over the Real Numbers. Theory Comput. Syst. 41(1): 107-118 (2007) |
| 2006 | ||
| 46 |  | Thomas Lickteig, Klaus Meer, Luis Miguel Pardo: Real Computation and Complexity, 1.-6. February 2004 Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006 |
| 45 | | 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 |
| 44 | | Klaus Meer: Optimization and Approximation Problems Related to Polynomial System Solving. CiE 2006: 360-367 |
| 43 | | Klaus Meer, Martin Ziegler: Uncomputability Below the Real Halting Problem. CiE 2006: 368-377 |
| 42 | | Klaus Meer, Dieter Rautenbach: On the OBDD Size for Graphs of Bounded Tree- and Clique-Width. IWPEC 2006: 72-83 |
| 41 | | Uffe Flarup Hansen, Klaus Meer: Approximation Classes for Real Number Optimization Problems. UC 2006: 86-100 |
| 40 | | Klaus Meer, Martin Ziegler: An Explicit Solution to Post's Problem over the Reals CoRR abs/cs/0603071: (2006) |
| 39 | | Martin Ziegler, Klaus Meer: Real Computational Universality: The Word Problem for a class of groups with infinite presentation CoRR abs/cs/0604032: (2006) |
| 38 | | Uffe Flarup Hansen, Klaus Meer: Two logical hierarchies of optimization problems over the real numbers. Math. Log. Q. 52(1): 37-50 (2006) |
| 2005 | ||
| 37 | | Klaus Meer: On Some Relations Between Approximation Problems and PCPs over the Real Numbers. CiE 2005: 322-331 |
| 36 | | Klaus Meer, Martin Ziegler: An Explicit Solution to Post's Problem over the Reals. FCT 2005: 467-478 |
| 35 | | Uffe Flarup Hansen, Klaus Meer: Two Logical Hierarchies of Optimization Problems over the Real Numbers. MFCS 2005: 459-470 |
| 34 | | Gregorio Malajovich, Klaus Meer: Computing Minimal Multi-homogeneous Bézout Numbers Is Hard. STACS 2005: 244-255 |
| 33 | | Klaus Meer: Probabilistically Checkable Proofs Over the Reals. Electr. Notes Theor. Comput. Sci. 123: 165-177 (2005) |
| 32 | | Klaus Meer: Transparent Long Proofs: A First PCP Theorem for NPR. Foundations of Computational Mathematics 5(3): 231-255 (2005) |
| 2004 | ||
| 31 | | Hubertus Th. Jongen, Klaus Meer, Eberhard Triesch: Optimization theory. Kluwer 2004: I-XI, 1-443 |
| 30 | | Klaus Meer, Gregorio Malajovich: On the Complexity of Computing Multi-Homogeneous Bézout Numbers. Algorithms and Complexity for Continuous Problems 2004 |
| 29 | | Klaus Meer: Transparent Long Proofs: A First PCP Theorem for NPR. ICALP 2004: 959-970 |
| 28 | | Klaus Meer: On the Approximation of Interval Functions. PARA 2004: 169-178 |
| 27 | | Thomas Lickteig, Klaus Meer, Luis Miguel Pardo: 04061 Abstracts Collection - Real Computation and Complexity. Real Computation and Complexity 2004 |
| 26 | | Thomas Lickteig, Klaus Meer, Luis Miguel Pardo: 04061 Summary - Real Computation and Complexity. Real Computation and Complexity 2004 |
| 25 | | Gregorio Malajovich, Klaus Meer: Computing Multi-Homogeneous Bezout Numbers is Hard CoRR cs.CC/0405021: (2004) |
| 24 | | Klaus Meer: On a Refined Analysis of Some Problems in Interval Arithmetic Using Real Number Complexity Theory. Reliable Computing 10(3): 209-225 (2004) |
| 2003 | ||
| 23 | | Klaus Meer: On the Complexity of Some Problems in Interval Arithmetic. MFCS 2003: 582-591 |
| 2002 | ||
| 22 | | Klaus Meer: On Consistency and Width Notions for Constraint Programs with Algebraic Constraints. FLOPS 2002: 88-102 |
| 21 | | 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) |
| 20 | | Marco Gori, Klaus Meer: A Step towards a Complexity Theory for Analog Systems. Math. Log. Q. 48(S1): 45-58 (2002) |
| 2000 | ||
| 19 | | 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 |
| 18 | | Shai Ben-David, Klaus Meer, Christian Michaux: A Note on Non-complete Problems in NPImage. J. Complexity 16(1): 324-332 (2000) |
| 17 | | Klaus Meer: Counting problems over the reals. Theor. Comput. Sci. 242(1-2): 41-58 (2000) |
| 1999 | ||
| 16 | | Klaus Meer: Query Languages for Real Number Databases Based on Descriptive Complexity over R. MFCS 1999: 12-22 |
| 15 | | 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) |
| 14 | | Felipe Cucker, Klaus Meer: Logics Which Capture Complexity Classes Over The Reals. J. Symb. Log. 64(1): 363-390 (1999) |
| 1998 | ||
| 13 | | Gregorio Malajovich, Klaus Meer: On the Structure of NP_C. SIAM J. Comput. 28(1): 27-35 (1998) |
| 1997 | ||
| 12 | | Felipe Cucker, Klaus Meer: Logics Which Capture Complexity Classes over the Reals. FCT 1997: 157-167 |
| 11 | | Klaus Meer: Counting Problems over the Reals. MFCS 1997: 398-407 |
| 10 | | Thomas Lickteig, Klaus Meer: Semi-algebraic Complexity--Additive Complexity of Matrix Computational Tasks. J. Complexity 13(1): 83-107 (1997) |
| 1996 | ||
| 9 | | Klaus Meer: On diagonal sets in uncountable structures. CCA 1996 |
| 1995 | ||
| 8 | | Erich Grädel, Klaus Meer: Descriptive complexity theory over the real numbers. STOC 1995: 315-324 |
| 7 | | Thomas Lickteig, Klaus Meer: A Note on Testing the Resultant. J. Complexity 11(3): 344-351 (1995) |
| 6 | | Klaus Meer: On the Relations Between Discrete and Continuous Complexity Theory. Math. Log. Q. 41: 281-286 (1995) |
| 1994 | ||
| 5 | | Klaus Meer: Real Number Computations: On the Use of Information. J. Symb. Comput. 18(3): 199-206 (1994) |
| 4 | | Klaus Meer: On the Complexity of Quadratic Programming in Real Number Models of Computation. Theor. Comput. Sci. 133(1): 85-84 (1994) |
| 1993 | ||
| 3 | | Klaus Meer: Real Number Models under Various Sets of Operations. J. Complexity 9(3): 366-372 (1993) |
| 1992 | ||
| 2 | | Klaus Meer: A note on a P NP result for a restricted class of real machines. J. Complexity 8(4): 451-453 (1992) |
| 1990 | ||
| 1 | | Klaus Meer: Computations over Z and R: A comparison. J. Complexity 6(3): 256-263 (1990) |
| 1 | Shai Ben-David | [18] |
| 2 | Irénée Briquel | [58] |
| 3 | Felipe Cucker | [12] [14] |
| 4 | Marco Gori | [20] [51] |
| 5 | Erich Grädel | [8] |
| 6 | Uffe Flarup Hansen | [35] [38] [41] |
| 7 | Hubertus Th. Jongen | [31] |
| 8 | Pascal Koiran | [53] [58] |
| 9 | Thomas Lickteig | [7] [10] [26] [27] [46] |
| 10 | Johann A. Makowsky (Janos Makowsky) | [19] |
| 11 | Gregorio Malajovich | [13] [25] [30] [34] [48] |
| 12 | Martín Matamala | [15] |
| 13 | Christian Michaux | [18] |
| 14 | Luis M. Pardo (Luis Miguel Pardo) | [26] [27] [46] |
| 15 | Dieter Rautenbach | [42] [55] |
| 16 | Eberhard Triesch | [31] |
| 17 | Gerhard-Wilhelm Weber (G.-W. Weber) | [21] |
| 18 | Martin Ziegler | [36] [39] [40] [43] [45] [50] [52] [54] |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page