Author:
Balcázar José L.,Lozano Antoni,Torán Jacobo
Reference29 articles.
1. J.L. Balcázar, J. Díaz, J. Gabarró: Structural Complexity I. EATCS Monographs on Theoretical Computer Science, vol. 11, Springer-Verlag (1988).
2. A. Chandra, D. Kozen, L. Stockmeyer: “Alternation”. Journal ACM 28 (1981), 114–133.
3. A. Chandra, L. Stockmeyer, U. Vishkin: “Constant depth reducibility”. SIAM Journal on Computing 13 (1984), 423–439.
4. B.S. Chlebus: “Domino-Tiling games”. Journal of Computer and System Sciences 32 (1986), 374–392.
5. M. Furst, J.B. Saxe, M. Sipser: “Parity, circuits, and the polynomial-time hierarchy”. Mathematical Systems Theory 17 (1984), 13–27.
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Checking LTL[F,G,X] on compressed traces in polynomial time;Proceedings of the 29th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering;2021-08-18
2. Sequential Relational Decomposition;Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science;2018-07-09
3. Descriptional and Computational Complexity of the Circuit Representation of Finite Automata;Language and Automata Theory and Applications;2018
4. The Minimum Oracle Circuit Size Problem;computational complexity;2016-02-17
5. Succinct Encodings of Graph Isomorphism;Language and Automata Theory and Applications;2014