Published in: LIPIcs, Volume 58, 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
Martijn Baartse and Klaus Meer. Real Interactive Proofs for VPSPACE. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 14:1-14:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{baartse_et_al:LIPIcs.MFCS.2016.14, author = {Baartse, Martijn and Meer, Klaus}, title = {{Real Interactive Proofs for VPSPACE}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {14:1--14:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.14}, URN = {urn:nbn:de:0030-drops-64300}, doi = {10.4230/LIPIcs.MFCS.2016.14}, annote = {Keywords: interactive proofs, real number computation, Shamir's theorem} }
Published in: LIPIcs, Volume 20, 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)
Martijn Baartse and Klaus Meer. The PCP theorem for NP over the reals. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 104-115, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InProceedings{baartse_et_al:LIPIcs.STACS.2013.104, author = {Baartse, Martijn and Meer, Klaus}, title = {{The PCP theorem for NP over the reals}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {104--115}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.104}, URN = {urn:nbn:de:0030-drops-39262}, doi = {10.4230/LIPIcs.STACS.2013.104}, annote = {Keywords: PCP, real number computation, systems of polynomials} }
Published in: Dagstuhl Seminar Proceedings, Volume 6391, Algorithms and Complexity for Continuous Problems (2007)
Klaus Meer and Martin Ziegler. Real Computational Universality: The Word Problem for a class of groups with infinite presentation. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 6391, pp. 1-20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{meer_et_al:DagSemProc.06391.2, author = {Meer, Klaus and Ziegler, Martin}, title = {{Real Computational Universality: The Word Problem for a class of groups with infinite presentation}}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--20}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {6391}, editor = {Stephan Dahlke and Klaus Ritter and Ian H. Sloan and Joseph F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06391.2}, URN = {urn:nbn:de:0030-drops-8773}, doi = {10.4230/DagSemProc.06391.2}, annote = {Keywords: Computational group theory, word problem, Blum-Shub-Smale model} }
Published in: Dagstuhl Seminar Proceedings, Volume 4061, Real Computation and Complexity (2006)
Thomas Lickteig, Klaus Meer, and Luis Miguel Pardo. 04061 Abstracts Collection – Real Computation and Complexity. In Real Computation and Complexity. Dagstuhl Seminar Proceedings, Volume 4061, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{lickteig_et_al:DagSemProc.04061.1, author = {Lickteig, Thomas and Meer, Klaus and Pardo, Luis Miguel}, title = {{04061 Abstracts Collection – Real Computation and Complexity}}, booktitle = {Real Computation and Complexity}, pages = {1--10}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {4061}, editor = {Thomas Lickteig and Klaus Meer and Luis Miguel Pardo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04061.1}, URN = {urn:nbn:de:0030-drops-4584}, doi = {10.4230/DagSemProc.04061.1}, annote = {Keywords: Real algebraic complexity and lower bounds, numerical methods, homotopy methods, condition as complexity ingredient, symbolic methods, bit complexity} }
Published in: Dagstuhl Seminar Proceedings, Volume 4061, Real Computation and Complexity (2006)
Thomas Lickteig, Klaus Meer, and Luis Miguel Pardo. 04061 Summary – Real Computation and Complexity. In Real Computation and Complexity. Dagstuhl Seminar Proceedings, Volume 4061, pp. 1-7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{lickteig_et_al:DagSemProc.04061.2, author = {Lickteig, Thomas and Meer, Klaus and Pardo, Luis Miguel}, title = {{04061 Summary – Real Computation and Complexity}}, booktitle = {Real Computation and Complexity}, pages = {1--7}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {4061}, editor = {Thomas Lickteig and Klaus Meer and Luis Miguel Pardo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04061.2}, URN = {urn:nbn:de:0030-drops-4994}, doi = {10.4230/DagSemProc.04061.2}, annote = {Keywords: } }
Published in: Dagstuhl Seminar Proceedings, Volume 4401, Algorithms and Complexity for Continuous Problems (2005)
Klaus Meer and Gregorio Malajovich. On the Complexity of Computing Multi-Homogeneous Bézout Numbers. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 4401, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{meer_et_al:DagSemProc.04401.9, author = {Meer, Klaus and Malajovich, Gregorio}, title = {{On the Complexity of Computing Multi-Homogeneous B\~{A}ƒ\^{A}©zout Numbers}}, booktitle = {Algorithms and Complexity for Continuous Problems}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {4401}, editor = {Thomas M\"{u}ller-Gronbach and Erich Novak and Knut Petras and Joseph F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04401.9}, URN = {urn:nbn:de:0030-drops-1460}, doi = {10.4230/DagSemProc.04401.9}, annote = {Keywords: multi-homogeneous B\~{A}ƒ\^{A}©zout numbers , number of roots of polynomials , approximation algorithms} }
Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)
Thomas Lickteig, Klaus Meer, and Luis Miguel Pardo. Real Computation and Complexity (Dagstuhl Seminar 04061). Dagstuhl Seminar Report 407, pp. 1-25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2004)
@TechReport{lickteig_et_al:DagSemRep.407, author = {Lickteig, Thomas and Meer, Klaus and Pardo, Luis Miguel}, title = {{Real Computation and Complexity (Dagstuhl Seminar 04061)}}, pages = {1--25}, ISSN = {1619-0203}, year = {2004}, type = {Dagstuhl Seminar Report}, number = {407}, institution = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemRep.407}, URN = {urn:nbn:de:0030-drops-152874}, doi = {10.4230/DagSemRep.407}, }
Feedback for Dagstuhl Publishing