Saeed Mehraban, Mehrdad Tahmasbi, Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024, 608
Ján Pich, “Localizability of the approximation method”, comput. complex., 33:2 (2024)
Andrzej Lingas, Lecture Notes in Computer Science, 13878, SOFSEM 2023: Theory and Practice of Computer Science, 2023, 301
Stasys Jukna, “Notes on Hazard-Free Circuits”, SIAM J. Discrete Math., 35:2 (2021), 770
Stasys Jukna, Hannes Seiwert, “Approximation Limitations of Pure Dynamic Programming”, SIAM J. Comput., 49:1 (2020), 170
Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah, “On the Complexity of Hazard-free Circuits”, J. ACM, 66:4 (2019), 1
Mateus De Oliveira Oliveira, Pavel Pudlák, “Representations of Monotone Boolean Functions by Linear Programs”, ACM Trans. Comput. Theory, 11:4 (2019), 1
Meena Mahajan, Nitin Saurabh, “Some Complete and Intermediate Polynomials in Algebraic Complexity Theory”, Theory Comput Syst, 62:3 (2018), 622
Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah, Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018, 878
Meena Mahajan, Nitin Saurabh, Lecture Notes in Computer Science, 9691, Computer Science – Theory and Applications, 2016, 251