Matematicheskoe Prosveshchenie
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Mat. Pros.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Matematicheskoe Prosveshchenie, Ser. 3, 2024, Issue 33, Pages 155–181 (Mi mp1121)  
По мотивам задачника

Сложность алгоритмов при построениях циркулем и линейкой

M. V. Alekhnovicha, A. Ya. Kanel-Belovbc, A. O. Suleikind

a University of California, San Diego
b Bar-Ilan University, Ramat Gan
c Moscow Institute of Physics and Technology (National Research University), Dolgoprudny, Moscow Region
d Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
Full-text PDF (410 kB)
Document Type: Popular science or education materials
Language: Russian
Citation: M. V. Alekhnovich, A. Ya. Kanel-Belov, A. O. Suleikin, “Сложность алгоритмов при построениях циркулем и линейкой”, Mat. Pros., Ser. 3, 33, MCCME, Moscow, 2024, 155–181
Citation in format AMSBIB
\Bibitem{AleKanSul24}
\by M.~V.~Alekhnovich, A.~Ya.~Kanel-Belov, A.~O.~Suleikin
\paper Сложность алгоритмов при построениях циркулем и линейкой
\serial Mat. Pros., Ser.~3
\yr 2024
\vol 33
\pages 155--181
\publ MCCME
\publaddr Moscow
\mathnet{http://mi.mathnet.ru/mp1121}
Linking options:
  • https://www.mathnet.ru/eng/mp1121
  • https://www.mathnet.ru/eng/mp/v33/s3/p155
    Ответы, указания, решения
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Matematicheskoe Prosveshchenie
    Statistics & downloads:
    Abstract page:183
    Full-text PDF :103
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2026