Funder
Austrian Science Fund
German Research Fundation
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference38 articles.
1. Abu-Khzam, F.N.: A kernelization algorithm for d-hitting set. J. Comput. Syst. Sci. 76(7), 524–531 (2010)
2. Artale, A., Kontchakov, R., Ryzhikov, V., Zakharyaschev, M.: The complexity of clausal fragments of LTL. In: Proc. 19th LPAR, LNCS, vol. 8312 (2013)
3. Bauland, M., Schneider, T., Schnoor, H., Schnoor, I., Vollmer, H.: The complexity of generalized satisfiability for linear temporal logic. LMCS 5(1), 1–21 (2009)
4. Chen, C.C., Lin, I.P.: The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic. IPL 45(3), 131–136 (1993)
5. Chen, J., Chor, B., Fellows, M., Huang, X., Juedes, D., Kanji, I., Xia, G.: Tight lower bounds for certain parameterized NP-hard problems. Inf. Comput. 201(2), 216–231 (2005)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Backdoor DNFs;Journal of Computer and System Sciences;2024-09
2. Strong Backdoors for Default Logic;ACM Transactions on Computational Logic;2024-06-17
3. Parameterised Enumeration for Modification Problems;Algorithms;2019-09-09