Speciality: 01.01.09 (Discrete mathematics and mathematical cybernetics)
Birth date: 25.09.1954
Phone: +7 (985) 304 73 65
E-mail:
Keywords: Circuits of functional elements, straight-line programs, size of cirquits, depth of circuits, bit complexity, arithmetic complexity, arithmetic operations, finite fields.
UDC: 517.51, 519.7, 517.5, 510.52, 515.1, 519.61, 519.71

Subject:

Complexity of approximate computations, Complexity of boolean functions, complexity of algebraic computations, computer arithmetic

Main publications:

1. Gashkov S.B., Sergeev I.S., “Ob odnom metode polucheniya nizhnikh otsenok slozhnosti monotonnykh arifmeticheskikh skhem, vychislyayuschikh deistvitelnye mnogochleny”, Matematicheskii sbornik, 203:10 (2012), 33–70
2. Gashkov S.B., “O slozhnosti priblizhennoi realizatsii funktsionalnykh kompaktov v nekotorykh prostranstvakh i o suschestvovanii funktsii s zadannoi po poryadku slozhnostyu”, Fundamentalnaya i prikladnaya matematika, 2:3 (1996), 675–774
3. Gashkov S.B., “Slozhnorealizuemye bulevy funktsii i trudnovychislimye deistvitelnye chisla”, Diskretnaya matematika, 3:1 (1991), 48–60
4. Gashkov S. B., “O slozhnosti priblizhennoi realizatsii nepreryvnykh funktsii skhemami i formulami v polinomialnykh i nekotorykh drugikh bazisakh”, Matematicheskie voprosy kibernetiki, 1995, № 5, 144–207
5. S. B. Gashkov, “Slozhnost realizatsii bulevykh funktsii skhemami iz funktsionalnykh elementov i formulami v bazisakh, elementy kotorykh realizuyut nepreryvnye funktsii”, Problemy kibernetiki, 1980, № 37, 57–118

Recent publications

Presentations in Math-Net.Ru

Personal pages:

• 
• 
• 
• 
• ISTINA
• 
• 
• 

Organisations:

• Lomonosov Moscow State University, Faculty of Mechanics and Mathematics