| |
Nechesov, Andrey Vitalievich
|
| Statistics Math-Net.Ru |
| Total publications: |
2 |
| Scientific articles: |
2 |
| Number of views: |
| This page: | 56 | | Abstract pages: | 118 | | Full texts: | 40 | | References: | 27 |
|
|
Researcher |
|
Candidate of physico-mathematical sciences (2023) |
| Speciality: |
01.01.06 (Mathematical logic, algebra, and number theory) |
| Birth date: |
7.02.1981 |
| Keywords: |
polynomial computability semantic programming artificial intelligence.
|
Subject: |
polynomial computability
semantic programming
artificial intelligence
|
| |
|
| Main publications: |
-
Sergey Goncharov; Andrey Nechesov, “Solution of the Problem P = L”, Mathematics, 10:1 (2022)
|
|
 |
https://www.mathnet.ru/eng/person195515 |
 |
List of publications on Google Scholar |
 |
List of publications on ZentralBlatt |
|
|
|
|
Publications in Math-Net.Ru |
Citations |
|
2022 |
| 1. |
A. V. Nechesov, “Semantic programming and polynomially computable representations”, Mat. Tr., 25:2 (2022), 174–202 ; Siberian Adv. Math., 33:1 (2023), 66–85 |
| 2. |
A. V. Nechesov, “Some questions on polynomially computable representations for generating grammars and Backus-Naur forms”, Mat. Tr., 25:1 (2022), 134–151 |
1
|
|
| Organisations |
|
|
Contact us: