Author:
Jenner Birgit,Torán Jacobo
Reference50 articles.
1. M. Agrawal and V. Arvind. A note on decision vs. search for graph automor-phism. Proceedings of the 11th Annual IEEE Conference on Computational Complexity, pp. 272–277, 1996.
2. E. Allender, D. Bruschi, and G. Pighizzini. The complexity of computing maximal word functions. Computational Complexity, 3: 368–391, 1993.
3. C. Àlvarez and B. Jenner. A very hard log-space counting class. Theoretical Computer Science, 107: 3–30, 1993.
4. C. Àlvarez and B. Jenner. A note on logspace optimization. Computational Complexity,5: 155–167, 1995.
5. C. Àlvarez, J. Balcázar, and B. Jenner. Adaptive logspace reducibility and parallel time. Mathematical Systems Theory, 28: 117–140, 1995.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献