Gregor Gramlich, Georg Schnitger, 3404, STACS 2005, 2005, 399
Lance Fortnow, “The status of the P versus NP problem”, Commun. ACM, 52, № 9, 2009, 78
Kenya UENO, “Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory”, IIS, 21, № 4, 2015, 329
John Rhodes, Pedro V. Silva, “Turing machines and bimachines”, Theoretical Computer Science, 400, № 1-3, 2008, 182
Lijie Chen, Roei Tell, Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023, 60
Ben Lee Volk, “Guest Column”, SIGACT News, 52, № 4, 2021, 56
Hông Vân Lê, “Lower Bounds for the Circuit Size of Partially Homogeneous Polynomials”, J Math Sci, 225, № 4, 2017, 639
Juraj Hromkovič, 6072, Computer Science – Theory and Applications, 2010, 181
Gregor Gramlich, Georg Schnitger, “Minimizing nfa's and regular expressions”, Journal of Computer and System Sciences, 73, № 6, 2007, 908
Eric Allender, 10010, Computability and Complexity, 2017, 79