David Gamarnik, Aukosh Jagannath, Alexander S. Wein, “Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics”, SIAM J. Comput., 53:1 (2024), 1
D. Gamarnik, A. Jagannath, A.S. Wein, “Circuit Lower Bounds for the p-Spin Optimization Problem”, Markov Processes And Related Fields, 2024, no. 2024 №1 (30), 81
Deepanshu Kush, Benjamin Rossman, “Tree-Depth and the Formula Complexity of Subgraph Isomorphism”, SIAM J. Comput., 52:1 (2023), 273
Balagopal Komarath, Anurag Pandey, C. S. Rahul, “Monotone Arithmetic Complexity of Graph Homomorphism Polynomials”, Algorithmica, 85:9 (2023), 2554
David Gamarnik, Cristopher Moore, Lenka Zdeborová, “Disordered systems insights on computational hardness”, J. Stat. Mech., 2022:11 (2022), 114015
Gregory Rosenthal, “Beating Treewidth for Average-Case Subgraph Isomorphism”, Algorithmica, 83:8 (2021), 2521
Deepanshu Kush, Benjamin Rossman, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020, 31
Huan Jin, Joshua M. Mitchell, Hunter N. B. Moseley, “Atom Identifiers Generated by a Neighborhood-Specific Graph Coloring Method Enable Compound Harmonization across Metabolic Databases”, Metabolites, 10:9 (2020), 368
Oleg Verbitsky, Maksim Zhukovskii, “The Descriptive Complexity of Subgraph Isomorphism Without Numerics”, Theory Comput Syst, 63:4 (2019), 902
Oleg Verbitsky, Maksim Zhukovskii, “Tight Bounds on the Asymptotic Descriptive Complexity of Subgraph Isomorphism”, ACM Trans. Comput. Logic, 20:2 (2019), 1