Author:
Pagourtzis Aris,Zachos Stathis
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Àlvarez, C., Jenner, B.: A very hard log space counting class. In: Proceedings of Structure in Complexity Theory Conference, pp. 154–168 (1990)
2. Durand, A., Hermann, M., Kolaitis, P.G.: Subtractive reductions and complete problems for counting complexity classes. Theoretical Computer Science 340(3), 496–513 (2005)
3. Dyer, M., Goldberg, L.A., Greenhill, C., Jerrum, M.: On the relative complexity of approximate counting problems. Algorithmica 38(3), 471–500 (2003)
4. Hemaspaandra, L.A., Homan, C.M., Kosub, S., Wagner, K.W.: The complexity of computing the size of an interval. Technical Report cs.cc/0502058, ACM Computing Research Repository (2005);
5. Preliminary version: Hemaspaandra, L.A., Kosub, S., Wagner, K.W.: The complexity of computing the size of an interval. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 1040–1051. Springer, Heidelberg (2001)
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献