Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,Computer Science Applications,Information Systems,Management Information Systems
Reference83 articles.
1. Abrams, D.S., Lloyd, S.: Nonlinear quantum mechanics implies polynomial-time solution for np-complete and #p problems. Phys. Rev. Lett. 81(18), 3992–3995 (1998)
2. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and hardness of approximation problems. Annual IEEE Symposium on Foundations of Computer Science, pp. 14–23 (1992)
3. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. J. ACM 45, 501–555 (1998)
4. Arora, S., Safra, S.: Probabilistic checking of proofs: a new characterization of np. J. ACM 45, 70–122 (1998)
5. Ausiello, G., Crescenzi, P., Gambosi, G., Marchetti-Spaccamela, A., Portasi, M.: Complexity and Approximation Combinatorial—Optimization Problems and Their Approximability Properties. Springer, Berlin (1999)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献