Author:
Bampas Evangelos,Göbel Andreas-Nikolas,Pagourtzis Aris,Tentes Aris
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Hemaspaandra, L.A., Homan, C.M., Kosub, S., Wagner, K.W.: The complexity of computing the size of an interval. SIAM J. Comput. 36(5), 1264–1300 (2007)
2. Kiayias, A., Pagourtzis, A., Sharma, K., Zachos, S.: The complexity of determining the order of solutions. In: Proceedings of the First Southern Symposium on Computing, Hattiesburg, Mississippi, December 4-5 (1998);
3. Extended and revised version: Acceptor-definable complexity classes. LNCS 2563, pp. 453–463. Springer, Heidelberg (2003)
4. Valiant, L.G.: The complexity of computing the permanent. Theor. Comput. Sci. 8, 189–201 (1979)
5. Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM J. Comput. 8(3), 410–421 (1979)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献