В. Б. Кудрявцев, А. Е. Андреев, “О сложности алгоритмов”, Фундамент. и прикл. матем., 15:3 (2009), 135–181 ; V. B. Kudryavtsev, A. E. Andreev, “On algorithm complexity”, J. Math. Sci., 168:1 (2010), 89–122
BENOIT LAROSE, MATT VALERIOTE, LÁSZLÓ ZÁDORI, “OMITTING TYPES, BOUNDED WIDTH AND THE ABILITY TO COUNT”, Int. J. Algebra Comput., 19:05 (2009), 647
Oded Goldreich, Lecture Notes in Computer Science, 3895, Theoretical Computer Science, 2006, 254
Michael Wooldridge, Paul E Dunne, “On the computational complexity of qualitative coalitional games”, Artificial Intelligence, 158:1 (2004), 27
А. Д. Коршунов, “Монотонные булевы функции”, УМН, 58:5(353) (2003), 89–162 ; A. D. Korshunov, “Monotone Boolean functions”, Russian Math. Surveys, 58:5 (2003), 929–1001
Tomás Feder, Moshe Y. Vardi, “The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory”, SIAM J. Comput., 28:1 (1998), 57
Satyanarayana V. Lokam, Lecture Notes in Computer Science, 1530, Foundations of Software Technology and Theoretical Computer Science, 1998, 307
R. Raz, P. McKenzie, Proceedings 38th Annual Symposium on Foundations of Computer Science, 1997, 234
Alexander A Razborov, Steven Rudich, “Natural Proofs”, Journal of Computer and System Sciences, 55:1 (1997), 24
S. Jukna, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference, 1997, 302