Author:
de Haan Ronald,Szeider Stefan
Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. Ajtai, M., Fagin, R., Stockmeyer, L.J.: The closure of monadic NP. J. of Computer and System Sciences 60(3), 660–716 (2000)
2. Arora, S., Barak, B.: Computational Complexity – A Modern Approach. Cambridge University Press (2009)
3. Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press (2009)
4. Cesati, M.: The Turing way to parameterized complexity. J. of Computer and System Sciences 67, 654–685 (2003)
5. Lecture Notes in Computer Science;Y. Chen,2012
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献