Speciality: 01.01.06 (Mathematical logic, algebra, and number theory)
E-mail:
Keywords: Algorithmic problems, generic complexity, complexity of computations
UDC: 510.52, 510.53
MSC: 03D15 68Q15 68Q17

Subject:

Algorithmic problems in algebra, logic and number theory. Generic complexity, complexity of computations.

Main publications:

1. A. N. Rybalov, “Generic amplification of recursively enumerable sets”, Algebra and Logic, 57:4 (2018), 289–294              
2. A. N. Rybalov, “Generic Gödel's incompleteness theorem”, Algebra and Logic, 56:3 (2017), 232–235            
3. A. N. Rybalov, “A generic relation on recursively enumerable sets”, Algebra and Logic, 55:5 (2016), 387–393            
4. Rybalov A., “Generic complexity of the Diophantine problem”, Groups Complexity Cryptology, 5:1 (2013) , 25–30 pp.        
5. A. Rybalov, “Generic Complexity of Presburger Arithmetic”, Theory of Computing Systems, 46:1 (2010), 2-8        
6. A. Rybalov, A. Myasnikov, “Generic complexity of undecidable problems”, Journal of Symbolic Logic, 73:2 (2008), 656-673            
7. A. Rybalov, “On the strongly generic undecidability of the Halting Problem”, Theoretical Computer Science, 377 (2007), 268-270            
8. A. Rybalov, “On the P–NP problem over real matrix rings”, Theoretical Computer Science, 314:1-2 (2004), 281–285            

Full list of scientific publications

Presentations in Math-Net.Ru

Personal pages:

• 
• 
• 
• 
• 

Organisations:

• Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
• Omsk Branch of Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
• Omsk State University
• Omsk State University