Author:
Montoya Juan Andrés,Müller Moritz
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference65 articles.
1. Ajtai, M., Komlós, J., Szemerédi, E.: Deterministic simulation in LOGSPACE. In: Proceedings of the 9th Annual ACM Symposium on Theory of Computing (STOC’87), pp. 132–140 (1987)
2. Alekhnovich, M., Razborov, A.A.: Resolution is not automatizable unless W[P] is tractable. In: Proceedings of the 41th IEEE Symposium on Foundations of Computer Science (FOCS’01), pp. 210–219 (2001)
3. Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM 42, 844–856 (1995)
4. Arora, S., Barak, B.: Computational Complexity: A Modern Perspective. Cambridge University Press, Cambridge (2009)
5. LNCS;V. Arvind,2002
Cited by
34 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Fixed-Parameter Tractability of Maximum Colored Path and Beyond;ACM Transactions on Algorithms;2024-06-28
2. Swarm Control for Distributed Construction: A Computational Complexity Perspective;ACM Transactions on Human-Robot Interaction;2023-02-15
3. References;Cognition and Intractability;2019-04-30
4. Applications;Cognition and Intractability;2019-04-30
5. Reflections and Elaborations;Cognition and Intractability;2019-04-30