TY - CHAP A1 - Meer, Klaus T1 - On consistency and width notions for constraint programs with algebraic constraints T2 - Functional and logic programming, 6th international symposium, proceedings, FLOPS 2002, Aizu, Japan, September 15 - 17, 2002 Y1 - 2002 SN - 3-540-44233-2 SP - 88 EP - 102 PB - Springer CY - Berlin [u.a.] ER - TY - CHAP A1 - Meer, Klaus ED - Prívara, Igor ED - Ružička, Peter T1 - Counting problems over the reals T2 - Mathematical foundations of computer science 1997, 22nd international symposium, proceedings, MFCS '97, Bratislava, Slovakia, August 25 - 29, 1997 N2 - 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. Y1 - 1997 UR - http://www.springer.com/us/book/9783540634379?wt_mc=ThirdParty.SpringerLink.3.EPR653.About_eBook SN - 978-3-540-63437-9 U6 - https://doi.org/10.1007/BFb0029983 SP - 398 EP - 407 PB - Springer CY - Berlin [u.a.] ER - TY - CHAP A1 - Meer, Klaus ED - Dongarra, Jack T1 - On the Approximation of Interval Functions T2 - Applied Parallel Computing. State of the Art in Scientific Computing, 7th International Workshop, PARA 2004, Lyngby, Denmark, June 20-23, 2004, Revised Selected Papers Y1 - 2004 SN - 978-3-540-29067-4 SP - 169 EP - 178 PB - Springer CY - Heidelberg [u.a.] ER - TY - CHAP A1 - Lickteig, Thomas A1 - Meer, Klaus A1 - Pardo, Luis Miguel T1 - Real Computation and Complexity, Dagstuhl seminar Y1 - 2006 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0030-drops-4994 UR - http://drops.dagstuhl.de/opus/volltexte/2006/499/ PB - Internationale Begegnungs- und Forschungszentrum für Informatik CY - Dagstuhl ER - TY - CHAP A1 - Meer, Klaus A1 - Baartse, Martijn T1 - The PCP theorem for NP over the reals T2 - 30th Symposium on Theoretical Aspects of Computer Science STACS , Kiel, 2013 Y1 - 2013 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0030-drops-39262 UR - http://drops.dagstuhl.de/opus/volltexte/2013/3926/ SP - 104 EP - 115 CY - Leibnitz ER - TY - CHAP A1 - Meer, Klaus T1 - Almost transparent short proof for NP? T2 - Extended abstract, Proceedings 18th International Symposium on Fundamentals of Computation Theory FCT 2011, Oslo, 2011 Y1 - 2011 SN - 978-3-642-22952-7 SP - 41 EP - 52 ER - TY - CHAP A1 - Meer, Klaus T1 - An Extended Tree-Width Notion for Directed Graphs Related to the Computation of Permanents Y1 - 2011 ER - TY - CHAP A1 - Koiran, Pascal A1 - Meer, Klaus T1 - On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width T2 - Graph-theoretic concepts in computer science, 34th international workshop, WG 2008, Durham, UK, June 30-July 2, 2008 Y1 - 2008 SN - 978-3-540-92247-6 SP - 252 EP - 263 PB - Springer CY - Berlin [u.a.] ER - TY - GEN A1 - Flarup Hansen, Uffe A1 - Meer, Klaus T1 - Two logical hierarchies of optimization problems over the real numbers T2 - Mathematical Logic Quaterly Y1 - 2006 SN - 0942-5616 VL - 52 IS - 1 SP - 37 EP - 50 ER - TY - CHAP A1 - Meer, Klaus T1 - Transparent long proofs: A first PCP theorem for NP(R) T2 - Extended Abstract in 31st International Colloquium on Automata, Languages and Programming ICALP 2004, Turku Y1 - 2004 SN - 3-540-22849-7 SP - 959 EP - 970 PB - Springer CY - Berlin ER -