TY - GEN A1 - Gori, Marco A1 - Meer, Klaus T1 - A step towards a complexity theory for analog systems. T2 - Mathematical Logic Quarterly Y1 - 2002 SN - 0942-5616 VL - 48 IS - Suppl. 1 SP - 45 EP - 58 ER - TY - CHAP A1 - Makowsky, Janos A. A1 - Meer, Klaus ED - Cucker, Felipe ED - Rojas, Maurice T1 - Polynomials of bounded treewidth T2 - Foundations of Computational Mathematics, Proceedings of the Smalefest 2000 Y1 - 2002 SN - 978-981-02-4845-1 SP - 211 EP - 250 PB - World Scientific CY - Singapore ER - TY - GEN A1 - Matamala, Martin A1 - Meer, Klaus T1 - On the computational structure of the connected components of difficult sets T2 - Information Processing Letters Y1 - 1999 SN - 0020-0190 VL - 72 IS - 3-4 SP - 83 EP - 90 ER - TY - GEN A1 - Cucker, Felipe A1 - Meer, Klaus T1 - Logics which capture complexity classes over the reals T2 - Journal of Symbolic Logic Y1 - 1999 SN - 0022-4812 VL - 64 IS - 1 SP - 363 EP - 390 ER - TY - GEN A1 - Benning, Wilhelm A1 - Elkoushy, Ashraf A1 - Meer, Klaus T1 - Innere-Punkt Methoden für die automatisierte Fehlersuche in geodätischen Anwendungen (Interior point methods for automatic blunders detection in surveying) T2 - Allgemeine Vermessungsnachrichten Y1 - 1997 SN - 0002-5968 VL - 104 IS - 8-9 SP - 319 EP - 324 ER - TY - GEN A1 - Meer, Klaus A1 - Michaux, Christian T1 - A Survey on Real Structural Complexity Theory T2 - Bulletin of the Belgian Mathematical Society Simon Stevin Y1 - 1997 SN - 1370-1444 VL - 4 IS - 1 SP - 113 EP - 148 ER - TY - GEN A1 - Baartse, Martijn A1 - Meer, Klaus T1 - An algebraic proof of the real number PCP theorem T2 - Journal of Complexity N2 - The PCP theorem has recently been shown to hold as well in the real number model of Blum, Shub, and Smale (Baartse and Meer, 2015). The proof given there structurally closely follows the proof of the original PCP theorem by Dinur (2007). In this paper we show that the theorem also can be derived using algebraic techniques similar to those employed by Arora et al. (Arora et al., 1998; Arora and Safra, 1998) in the first proof of the PCP theorem. This needs considerable additional efforts. Due to severe problems when using low degree algebraic polynomials over the reals as codewords for one of the verifiers to be constructed, we work with certain trigonometric polynomials. This entails the necessity to design new segmentation procedures in order to obtain well structured real verifiers appropriate for applying the classical technique of verifier composition. We believe that designing as well an algebraic proof for the real PCP theorem on one side leads to interesting questions in real number complexity theory and on the other sheds light on which ingredients are necessary in order to prove an important result as the PCP theorem in different computational models. KW - Probabilistically checkable proofs KW - Real number model of computation KW - PCP theorem for NP over the reals KW - Testing trigonometric polynomials KW - Algebraic proofs Y1 - 2017 UR - http://www.sciencedirect.com/science/article/pii/S0885064X1630111X U6 - https://doi.org/10.1016/j.jco.2016.11.006 SN - 0885-064X VL - 40 SP - 34 EP - 77 ER - TY - GEN A1 - Baartse, Martijn A1 - Meer, Klaus T1 - Interactive proofs and a Shamir-like result for real number computations T2 - Computational Complexity Y1 - 2018 U6 - https://doi.org/10.1007/s00037-018-0174-6 SN - 1016-3328 SN - 1420-8954 ER - TY - CHAP A1 - Baartse, Martijn A1 - Meer, Klaus ED - Faliszewski, Piotr ED - Muscholl, Anca ED - Niedermeier, Rolf T1 - Real Interactive Proofs for VPSPACE T2 - 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016) Y1 - 2016 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0030-drops-64300 SN - 978-3-95977-016-3 SP - 14.1 EP - 14.13 PB - Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH CY - Wadern ER - TY - CHAP A1 - Meer, Klaus A1 - Baartse, Martijn ED - Beckmann, Arnold ED - Mitrana, Victor ED - Soskova, Mariya T1 - Some results on interactive proofs for real computations T2 - Evolving Computability 11th Conference on Computability in Europe, CiE 2015, Bucharest, Romania, June 29-July 3, 2015, Proceedings Y1 - 2015 UR - http://www.springer.com/in/book/9783319200279 SN - 978-3-319-20027-9 U6 - https://doi.org/10.1007/978-3-319-20028-6 SP - 107 EP - 116 PB - Springer International Publishing CY - Berlin [u.a.] ER -