Alekhnovich Michael Vladimirovich

Publications in Math-Net.Ru

1. Сложность алгоритмов при построениях циркулем и линейкой
   
   Mat. Pros., Ser. 3, 33 (2024),  155–181
2. Lower Bounds for Polynomial Calculus: Nonbinomial Case
   
   Trudy Mat. Inst. Steklova, 242 (2003),  23–43
3. Lower bounds for polynomial calculus in the case of nonbinomial ideals
   
   Dokl. Akad. Nauk, 380:3 (2001),  295–297


4. The complexity of algorithms of constructions by compass and straightedge
   
   Fundam. Prikl. Mat., 7:2 (2001),  597–614