Author:
Alves Mateus Rodrigues,de Oliveira Oliveira Mateus,Silva Janio Carlos Nascimento,dos Santos Souza Uéverton
Publisher
Springer International Publishing
Reference22 articles.
1. Barrington, D.A.M., Lu, C.-J., Miltersen, P.B., Skyum, S.: On monotone planar circuits. In: Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity, pp. 24–31 (1999)
2. Cai, L., Fellows, M., Juedes, D., Rosamond, F.: The complexity of polynomial-time approximation. Theory Comput. Syst. 41(3), 459–477 (2007)
3. Creignou, N., Vollmer, H.: Parameterized complexity of weighted satisfiability problems: decision, enumeration, counting. Fundam. Inform. 136(4), 297–316 (2015)
4. Cygan, M., et al.: Lower bounds for kernelization. In: Parameterized Algorithms, pp. 523–555. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21275-3_15
5. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (2012)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献