Author:
Chen Yijia,Grohe Martin,Grüber Magdalena
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Arora, S., Safra, S.: Probabilistic checking of proofs: a new characterization of NP. Journal of the ACM 45(1), 70–122 (1998)
2. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation. Springer, Heidelberg (2003)
3. Cai, L., Chen, J., Downey, R.G., Fellows, M.R.: On the parameterized complexity of short computation and factorization. Archive for Mathematical Logic 36, 321–337 (1997)
4. Cai, L., Huang, X.: Fixed-Parameter Approximation: Conceptual Framework and Approximability Results. These proceedings
5. Cesati, M., Di Ianni, M.: Computation models for parameterized complexity. Mathematical Logic Quarterly 43, 179–202 (1997)
Cited by
31 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献