Author:
Baartse Martijn,Meer Klaus
Publisher
Springer International Publishing
Reference13 articles.
1. Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press (2009)
2. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and hardness of approximation problems. Journal of the ACM 45(3), 501–555 (1998)
3. Arora, S., Safra, S.: Probabilistic checking proofs: A new characterization of NP. Journal of the ACM 45(1), 70–122 (1998)
4. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer (1999)
5. Baartse, M., Meer, K.: The PCP theorem for NP over the reals. To appear in Foundations of Computational Mathematics. Springer
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An Algebraic Proof of the Real Number PCP Theorem;Mathematical Foundations of Computer Science 2015;2015
2. The PCP Theorem for NP Over the Reals;Foundations of Computational Mathematics;2014-03-28