@inproceedings{Meer, author = {Meer, Klaus}, title = {Transparent long proofs: A first PCP theorem for NP(R)}, series = {Extended Abstract in 31st International Colloquium on Automata, Languages and Programming ICALP 2004, Turku}, booktitle = {Extended Abstract in 31st International Colloquium on Automata, Languages and Programming ICALP 2004, Turku}, publisher = {Springer}, address = {Berlin}, isbn = {3-540-22849-7}, pages = {959 -- 970}, language = {en} } @book{JongenMeerTriesch, author = {Jongen, Hubertus Theodor and Meer, Klaus and Triesch, Eberhard}, title = {Optimization Theory}, publisher = {Kluwer}, address = {Boston}, isbn = {978-1-402-08098-2}, pages = {XI, 443}, language = {en} } @misc{Meer, author = {Meer, Klaus}, title = {Simulated Annealing versus Metropolis for a TSP instance}, series = {Information Processing Letters}, volume = {104}, journal = {Information Processing Letters}, number = {6}, issn = {0020-0190}, pages = {216 -- 219}, language = {en} } @misc{MalajovichMeer, author = {Malajovich, Gregorio and Meer, Klaus}, title = {Computing Minimal Multi-Homogeneous B{\´e}zout Numbers Is Hard}, series = {Theory of Computing Systems}, volume = {40}, journal = {Theory of Computing Systems}, number = {4}, issn = {1432-4350}, pages = {553 -- 570}, language = {en} } @misc{Meer, author = {Meer, Klaus}, title = {On some relations between approximation and PCPs over the real numbers}, series = {Theory of Computing Systems}, volume = {41}, journal = {Theory of Computing Systems}, number = {1}, issn = {1432-4350}, pages = {107 -- 118}, language = {en} } @misc{FlarupHansenMeer, author = {Flarup Hansen, Uffe and Meer, Klaus}, title = {Two logical hierarchies of optimization problems over the real numbers}, series = {Mathematical Logic Quaterly}, volume = {52}, journal = {Mathematical Logic Quaterly}, number = {1}, issn = {0942-5616}, pages = {37 -- 50}, language = {en} } @misc{Meer, author = {Meer, Klaus}, title = {Transparent long proofs: A first PCP Theorem for NP(R)}, series = {Foundations of Computational Mathematics}, volume = {5}, journal = {Foundations of Computational Mathematics}, number = {3}, issn = {1615-3375}, pages = {231 -- 255}, language = {en} } @misc{Meer, author = {Meer, Klaus}, title = {Probabilistically checkable proofs over the reals}, series = {Electronic notes in theoretical computer science : ENTCS}, volume = {123}, journal = {Electronic notes in theoretical computer science : ENTCS}, issn = {1571-0661}, pages = {165 -- 177}, language = {en} } @misc{Meer, author = {Meer, Klaus}, title = {On a refined analysis of some problems in interval arithmetic using real number complexity theory}, series = {Reliable Computing}, volume = {10}, journal = {Reliable Computing}, number = {3}, issn = {1385-3139}, pages = {209 -- 225}, language = {en} } @inproceedings{GoriMeer, author = {Gori, Marco and Meer, Klaus}, title = {Some aspects of a complexity theory for continuous time systems}, series = {Extended abstract, Proceedings Computability in Europe, CiE 2007, Siena, Italy, June 18 - 23, 2007}, booktitle = {Extended abstract, Proceedings Computability in Europe, CiE 2007, Siena, Italy, June 18 - 23, 2007}, editor = {Cooper, Stuart Barry}, publisher = {Springer}, address = {Berlin}, isbn = {978-3-540-73000-2}, pages = {554 -- 565}, language = {en} } @inproceedings{MeerRautenbach, author = {Meer, Klaus and Rautenbach, Dieter}, title = {On the OBDD size for graphs of bounded tree- and clique-width}, series = {Parameterized and exact computation, Second International Workshop, IWPEC 2006, Z{\"u}rich, Switzerland, September 13 - 15, 2006}, booktitle = {Parameterized and exact computation, Second International Workshop, IWPEC 2006, Z{\"u}rich, Switzerland, September 13 - 15, 2006}, editor = {Bodlaender, Hans L.}, publisher = {Springer}, address = {Berlin [u.a.]}, isbn = {978-3-540-39098-5}, pages = {72 -- 83}, language = {en} } @inproceedings{FlarupHansenMeer, author = {Flarup Hansen, Uffe and Meer, Klaus}, title = {Approximation classes for real number optimization problems}, series = {Extended abstract, 5th International conference on Unconventional Computation, York, UK, September 4-8, 2006}, booktitle = {Extended abstract, 5th International conference on Unconventional Computation, York, UK, September 4-8, 2006}, editor = {Calude, Cristian}, publisher = {Springer}, address = {Berlin}, isbn = {978-3-540-38593-6}, pages = {86 -- 100}, language = {en} } @inproceedings{Zheng, author = {Zheng, Xizhong}, title = {A Computability Theory of Real Numbers}, series = {CCA 2008, August 21 - 24, 2008, Hagen, Germany}, booktitle = {CCA 2008, August 21 - 24, 2008, Hagen, Germany}, editor = {Brattka, Vasco}, publisher = {Hagen}, address = {Fernuniv.}, language = {en} } @inproceedings{Meer, author = {Meer, Klaus}, title = {On Ladner's Result for a Class of Real Machines with Restricted use of Constants}, series = {5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19 - 24, 2009}, booktitle = {5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19 - 24, 2009}, editor = {Ambos-Spies, Klaus}, publisher = {Springer}, address = {Heidelber [u.a.]}, isbn = {978-3-642-03072-7}, pages = {352 -- 361}, language = {en} } @inproceedings{RettingerZheng, author = {Rettinger, Robert and Zheng, Xizhong}, title = {Points on Computable Curves of Computable Lengths}, language = {en} } @inproceedings{RettingerZheng, author = {Rettinger, Robert and Zheng, Xizhong}, title = {On the Computability of the Rectifiable Simple Curves}, language = {en} } @misc{Meer, author = {Meer, Klaus}, title = {Fragestellungen aus Mathematik und theoretischer Informatik bei der Konstruktion von Getrieben}, series = {Forum der Forschung}, volume = {12}, journal = {Forum der Forschung}, number = {21}, issn = {0947-6989}, pages = {145 -- 150}, language = {de} } @article{Zheng, author = {Zheng, Xizhong}, title = {Classification of Computably Approximable Real Numbers}, language = {en} } @article{Zheng, author = {Zheng, Xizhong}, title = {A Hierarchy of Computably Enumerable Reals}, language = {en} } @misc{MeerZiegler, author = {Meer, Klaus and Ziegler, Martin}, title = {Real Computational Universality: The word problem for a class of groups with infinite presentation}, language = {en} } @inproceedings{KoiranMeer, author = {Koiran, Pascal and Meer, Klaus}, title = {On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width}, series = {Graph-theoretic concepts in computer science, 34th international workshop, WG 2008, Durham, UK, June 30-July 2, 2008}, booktitle = {Graph-theoretic concepts in computer science, 34th international workshop, WG 2008, Durham, UK, June 30-July 2, 2008}, publisher = {Springer}, address = {Berlin [u.a.]}, isbn = {978-3-540-92247-6}, pages = {252 -- 263}, language = {en} }