@inproceedings{Meer, author = {Meer, Klaus}, title = {On consistency and width notions for constraint programs with algebraic constraints}, series = {Functional and logic programming, 6th international symposium, proceedings, FLOPS 2002, Aizu, Japan, September 15 - 17, 2002}, booktitle = {Functional and logic programming, 6th international symposium, proceedings, FLOPS 2002, Aizu, Japan, September 15 - 17, 2002}, publisher = {Springer}, address = {Berlin [u.a.]}, isbn = {3-540-44233-2}, pages = {88 -- 102}, language = {en} } @inproceedings{Meer, author = {Meer, Klaus}, title = {Counting problems over the reals}, series = {Mathematical foundations of computer science 1997, 22nd international symposium, proceedings, MFCS '97, Bratislava, Slovakia, August 25 - 29, 1997}, booktitle = {Mathematical foundations of computer science 1997, 22nd international symposium, proceedings, MFCS '97, Bratislava, Slovakia, August 25 - 29, 1997}, editor = {Pr{\´i}vara, Igor and Ružička, Peter}, publisher = {Springer}, address = {Berlin [u.a.]}, isbn = {978-3-540-63437-9}, doi = {10.1007/BFb0029983}, pages = {398 -- 407}, abstract = {In this paper we introduce a complexity theoretic notion of counting problems over the real numbers. We follow the approaches of Blum, Shub, and Smale.}, language = {en} } @inproceedings{Meer, author = {Meer, Klaus}, title = {On the Approximation of Interval Functions}, series = {Applied Parallel Computing. State of the Art in Scientific Computing, 7th International Workshop, PARA 2004, Lyngby, Denmark, June 20-23, 2004, Revised Selected Papers}, booktitle = {Applied Parallel Computing. State of the Art in Scientific Computing, 7th International Workshop, PARA 2004, Lyngby, Denmark, June 20-23, 2004, Revised Selected Papers}, editor = {Dongarra, Jack}, publisher = {Springer}, address = {Heidelberg [u.a.]}, isbn = {978-3-540-29067-4}, pages = {169 -- 178}, language = {en} } @inproceedings{LickteigMeerPardo, author = {Lickteig, Thomas and Meer, Klaus and Pardo, Luis Miguel}, title = {Real Computation and Complexity, Dagstuhl seminar}, publisher = {Internationale Begegnungs- und Forschungszentrum f{\"u}r Informatik}, address = {Dagstuhl}, url = {http://nbn-resolving.de/urn:nbn:de:0030-drops-4994}, language = {en} } @inproceedings{MeerBaartse, author = {Meer, Klaus and Baartse, Martijn}, title = {The PCP theorem for NP over the reals}, series = {30th Symposium on Theoretical Aspects of Computer Science STACS , Kiel, 2013}, booktitle = {30th Symposium on Theoretical Aspects of Computer Science STACS , Kiel, 2013}, address = {Leibnitz}, doi = {10.4230/LIPIcs.STACS.2013.104}, url = {http://nbn-resolving.de/urn:nbn:de:0030-drops-39262}, pages = {104 -- 115}, language = {en} } @inproceedings{Meer, author = {Meer, Klaus}, title = {Almost transparent short proof for NP?}, series = {Extended abstract, Proceedings 18th International Symposium on Fundamentals of Computation Theory FCT 2011, Oslo, 2011}, booktitle = {Extended abstract, Proceedings 18th International Symposium on Fundamentals of Computation Theory FCT 2011, Oslo, 2011}, isbn = {978-3-642-22952-7}, pages = {41 -- 52}, language = {en} } @inproceedings{Meer, author = {Meer, Klaus}, title = {An Extended Tree-Width Notion for Directed Graphs Related to the Computation of Permanents}, 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} } @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} } @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} }