RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 
Vereshchagin, Nikolai Konstantinovich

Statistics Math-Net.Ru
Total publications: 8
Scientific articles: 8
Presentations: 13

Number of views:
This page:1344
Abstract pages:1662
Full texts:506
References:127
E-mail: ,

http://www.mathnet.ru/eng/person8803
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/213717

Publications in Math-Net.Ru
2011
1. Nikolay K. Vereshchagin, Andrej A. Muchnik, “On joint conditional complexity (entropy)”, Tr. Mat. Inst. Steklova, 274 (2011),  103–118  mathnet  mathscinet  elib; Proc. Steklov Inst. Math., 274 (2011), 90–104  isi  elib  scopus
2003
2. N. K. Vereshchagin, D. P. Skvortsov, E. Z. Skvortsova, A. V. Chernov, “Variants of Realizability for Propositional Formulas and the Logic of Weak Excluded Middle”, Tr. Mat. Inst. Steklova, 242 (2003),  77–97  mathnet  mathscinet  zmath; Proc. Steklov Inst. Math., 242 (2003), 67–85
1995
3. N. K. Vereshchagin, “Oracle separation of complexity classes and lower bounds for perceptrons solving separation problems”, Izv. RAN. Ser. Mat., 59:6 (1995),  3–24  mathnet  mathscinet  zmath; Izv. Math., 59:6 (1995), 1103–1122  isi
1993
4. N. K. Vereshchagin, “Relativizable and nonrelativizable theorems in the polynomial theory of algorithms”, Izv. RAN. Ser. Mat., 57:2 (1993),  51–90  mathnet  mathscinet  zmath; Russian Acad. Sci. Izv. Math., 42:2 (1994), 261–298  isi
5. N. K. Vereshchagin, “The relation between $NP$ and co-$NP$ sets with respect to a random oracle”, Izv. Vyssh. Uchebn. Zaved. Mat., 1993, 3,  31–39  mathnet  mathscinet  zmath; Russian Math. (Iz. VUZ), 37:3 (1993), 29–37
1990
6. N. K. Vereshchagin, “New proof of the solvability of the elementary theory of linearly ordered sets”, Mat. Zametki, 47:5 (1990),  31–38  mathnet  mathscinet  zmath; Math. Notes, 47:5 (1990), 444–449  isi
1985
7. N. K. Vereshchagin, “Occurrence of zero in a linear recursive sequence”, Mat. Zametki, 38:2 (1985),  177–189  mathnet  mathscinet  zmath; Math. Notes, 38:2 (1985), 609–615  isi
1984
8. N. K. Vereshchagin, “Zeros of linear recursive sequences”, Dokl. Akad. Nauk SSSR, 278:5 (1984),  1036–1039  mathnet  mathscinet  zmath

Presentations in Math-Net.Ru
1. Algorithmic statistics
N. K. Vereshchagin
Colloquium of the Steklov Mathematical Institute of Russian Academy of Sciences
May 23, 2019 16:00   
2. Колмогоровская сложность вычислимых 0-1-последовательностей
N. K. Vereshchagin
Traditional winter session MIAN–POMI devoted to the topic "Mathematical logic"
December 24, 2018 12:35   
3. Алгоритмическая статистика
N. K. Vereshchagin
Seminar of the Department of Mathematical Logic "Algorithmic problems in algebra and logic"
October 6, 2015 18:30
4. Информационная и коммуникационная сложность: общий и приватные источники случайности
N. K. Vereshchagin, A. Kozachinsky
Kolmogorov seminar on computational complexity and descriptive complexity
March 17, 2014 16:45
5. Communication complexity of approximation of Kolmogorov complexity
N. K. Vereshchagin
Kolmogorov seminar on computational complexity and descriptive complexity
December 16, 2013 16:45
6. High Entropy Random Selection Protocols
N. K. Vereshchagin
Symposium on logic and computability "Logic and Computation Day"
June 7, 2013 11:00
7. Communicative information
N. K. Vereshchagin
Kolmogorov seminar on computational complexity and descriptive complexity
April 8, 2013 16:45
8. Short lists with short programs in short time
N. K. Vereshchagin
Kolmogorov seminar on computational complexity and descriptive complexity
December 17, 2012 16:45
9. Group representations and locally decodable codes
N. K. Vereshchagin
Kolmogorov seminar on computational complexity and descriptive complexity
October 29, 2012 16:45
10. What we can compute given random strings as an oracle
N. K. Vereshchagin
Kolmogorov seminar on computational complexity and descriptive complexity
April 28, 2012 16:45
11. The notion of zero knowledge
N. K. Vereshchagin
Kolmogorov seminar on computational complexity and descriptive complexity
April 23, 2012 16:45
12. On abstract resource semantics and computabilty logic
Nikolay Vereshchagin
International workshop "Logical Models of Reasoning and Computation"
February 2, 2012 12:45   
13. Algorithmic statistics
N. K. Vereshchagin
Globus Seminar
November 24, 2011 15:40   

Organisations
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019