Publications in Math-Net.Ru
-
Algorithms for SAT and upper bounds on their complexity
Zap. Nauchn. Sem. POMI, 277 (2001), 14–46
-
Probabilistic verification of proofs in calculuses
Zap. Nauchn. Sem. POMI, 241 (1997), 97–116
-
Randomized proofs in arithmetic
Zap. Nauchn. Sem. POMI, 220 (1995), 49–71
-
Probabilistic inference in prediction systems
Dokl. Akad. Nauk SSSR, 307:1 (1989), 17–21
-
Two tautologihood proof systems based on the split method
Zap. Nauchn. Sem. LOMI, 105 (1981), 24–44
-
On an approximative version of the notion of constructive analytic function
Zap. Nauchn. Sem. LOMI, 60 (1976), 49–58
-
The increase of the complexity of functions at an application of the multiple recursion
Zap. Nauchn. Sem. LOMI, 32 (1972), 12–17
-
Gregory Samuilovich Tseytin (obituary)
Uspekhi Mat. Nauk, 78:3(471) (2023), 170–176
-
Nikolai Aleksandrovich Shanin (obituary)
Uspekhi Mat. Nauk, 68:4(412) (2013), 173–176
-
Nikolai Aleksandrovich Shanin (on his 80th birthday)
Uspekhi Mat. Nauk, 56:3(339) (2001), 181–184
© , 2024