|
|
|
Publications in Math-Net.Ru |
Citations |
|
2003 |
| 1. |
M. V. Alekhnovich, A. A. Razborov, “Lower Bounds for Polynomial Calculus: Nonbinomial Case”, Trudy Mat. Inst. Steklova, 242 (2003), 23–43    ; Proc. Steklov Inst. Math., 242 (2003), 18–35 |
23
|
|
2001 |
| 2. |
M. V. Alekhnovich, A. A. Razborov, “Lower bounds for polynomial calculus in the case of nonbinomial ideals”, Dokl. Akad. Nauk, 380:3 (2001), 295–297 ; Dokl. Math., 64:2 (2001), 177–179 |
|
|
| 3. |
M. V. Alekhnovich, A. Ya. Belov, “The complexity of algorithms of constructions by compass and straightedge”, Fundam. Prikl. Mat., 7:2 (2001), 597–614 |
|
| Organisations |
|
|
Contact us: