Martijn Baartse

MaRDI QIDQ1946507zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Interactive proofs and a Shamir-like result for real number computations Computational Complexity	2019-08-30	Paper
Real interactive proofs for VPSPACE	2018-03-21	Paper
An algebraic proof of the real number PCP theorem Journal of Complexity	2017-05-24	Paper
The PCP theorem for NP over the reals	2017-01-30	Paper
scientific article; zbMATH DE number 6536267 (Why is no real title available?)	2016-01-27	Paper
Some results on interactive proofs for real computations Evolving Computability	2015-10-20	Paper
An Algebraic Proof of the Real Number PCP Theorem Mathematical Foundations of Computer Science 2015	2015-09-16	Paper
Topics in real and complex number complexity theory Recent Advances in Real Complexity and Computation	2015-08-04	Paper
The PCP theorem for NP over the reals Foundations of Computational Mathematics	2015-07-22	Paper
Testing Low Degree Trigonometric Polynomials Computer Science - Theory and Applications	2014-06-24	Paper
On the gap between trivial and nontrivial initial segment prefix-free complexity Theory of Computing Systems	2013-04-15	Paper

Research outcomes over time

This page was built for person: Martijn Baartse