23 citations to https://www.mathnet.ru/rus/tm403
-
Alekhnovich M., Ben-Sasson E., Razborov A.A., Wigderson A., “Pseudorandom generators in propositional proof complexity”, SIAM J. Comput., 34:1 (2004), 67–88
-
Razborov A.A., “Feasible proofs and computations: Partnership and fusion”, Automata, languages and programming, 31st international colloquium, ICALP 2004 (Turku, Finland, July 12–16, 2004), Proceedings, Lecture Notes in Comput. Sci., 3142, 2004, 8–14
-
Razborov A.A., “Feasible proofs and computations: Partnership and fusion”, 19th Annual IEEE Symposium on Logic in Computer Science, Proceedings, Proceedings/Symposium on Logic in Computer Science, 2004, 134–138