Дмитрий Голубенко , Алексей Крошнин , Эдуард Горбунов - Алгоритмы и модели вычисления

of

Mathematics

Computational complexity: a modern approach
Graph theory

J. ACM

Journal of Mathematics

Bulletin American Mathematical Society
American
Computing

History of the Theory of Numbers

arXiv e-prints
Complexity of algorithms
Algebraic Shift Register Sequences
Annals of the History of Computing
One thousand exercises in probability
Graphs, Networks and Algorithms
Randomized algorithms
The American Mathematical
Monthly

Èçáðàííûå çàäà÷è è ðåøåíèÿ
[18]
[19]
[20]
[21]

[22]
[23]
[24]
[25]
[26]
[27]
[28]
[29]
[30]
[31]
[32]
[33]
[34]
[35]
[36]
[37]
[38]

Áèáëèîãðàôèÿ

SIAM Journal of Computing

Vaughn Pratt. Every prime has a succint serticate. Â:
4.3 (1975), ñ. 214220. url: http://boole.stanford.edu/pub/SucCert.pdf.
J. Barkley Rosser è Lowell Schoenfeld. Approximate formulas for some functions of
prime numbers. Â:
6.1 (ìàðò 1962), ñ. 6494. doi: 10.1215/ijm/
1255631807. url: https://doi.org/10.1215/ijm/1255631807.
V. Shoup.
. 2009. url: http://e-maxx.
ru/bookz/files/shoup.pdf.
A. M. Turing. On Computable Numbers, with an Application to the Entscheidungsproblem.
A Correction. Â:
s2-43.1 (1938), ñ. 544
546. doi: 10.1112/plms/s2-43.6.544. eprint: https://londmathsoc.onlinelibrary.
wiley . com / doi / pdf / 10 . 1112 / plms / s2 - 43 . 6 . 544. url: https : / / londmathsoc .
onlinelibrary.wiley.com/doi/abs/10.1112/plms/s2-43.6.544.
Í. Àëîí è Äæ. Ñïåíñåð.
. Ìîñêâà: Áèíîì, 2011.
Ì. Áàëàçàð.
. ÌÖÍÌÎ, 2013.
url: http://www.mccme.ru/free-books/dubna/balazard.pdf.
È. Âèíîãðàäîâ.
. Ìîñêâà: Ãîñòåõèçäàò, 1952.
Ä. Ãèëüáåðò è Â. Àêêåðìàí.
. Ìîñêâà: Èíîñòðàííàÿ
ëèòåðàòóðà, 1947.
À.À. Ãëèáè÷óê è äð.
. ÌÖÍÌÎ, 2016. url: https:
//www.mccme.ru/circles/oim/discrbook.pdf.
Ì. Ãýðè è Ä. Äæîíñîí.
. Ìîñêâà:
Ìèð, 1982.
Ñ. Äàñãóïòà, Õ. Ïàïàäèìèòðèó è Ó. Âàçèðàíè.
. Ìîñêâà: ÌÖÍÌÎ, 2014.
À. Çâîíêèí è Ñ. Ëàíäî.
. Ìîñêâà: ÌÖÍÌÎ, 2010.
À. Êèòàåâ, À. Øåíü è Ì. Âÿëûé.
. Ìîñêâà:
ÌÖÍÌÎ, 1999.
Ä. Êíóò.
. Ìîñêâà: Âèëüÿìñ, 2002.
Ò. Êîðìåí è äð.
. 3-å èçä. Ìîñêâà: Âèëüÿìñ, 2013.
Í. Êóçþðèí è Ñ. Ôîìèí.
.
Ìîñêâà: Ìèð, 1979.
Ä. Â. Ìóñàòîâ.
. êîíñïåêò ëåêöèé. ÌÔÒÈ, 2016. url: http://
ru.discrete-mathematics.org/fall2016/3/complexity/compl-book.pdf.
Àë. Îìåëü÷åíêî.
. Ìîñêâà: ÌÖÍÌÎ, 2018.
Õ. Ïàïàäèìèòðèó è Ê. Ñòàéãëèö.
. Ìîñêâà: Ìèð, 1985.
Ð. Ñåäæâèê.
. Ì.: Äèà-Ñîôò, 2001.
À. Øèðÿåâ.
. Ìîñêâà: ÌÖÍÌÎ, 2003.

Illinois J. Math.
A computuational introduction to group theory

Proceedings of the London Mathematical Society

Âåðîòÿíîñòíûé ìåòîä
Àñèìïòîòè÷åñêèé çàêîí ðàñïðåäåëåíèÿ ïðîñòûõ ÷èñåë
Îñíîâû òåîðèè ÷èñåë
Îñíîâû òåîðåòè÷åñêîé ëîãèêè
Ýëåìåíòû ìàòåìàòèêè â çàäà÷àõ
Âû÷èñëèòåëüíûå ìàøèíû è òðóäíîðåøàåìûå çàäà÷è
Àëãîðèòìû
Ãðàôû íà ïîâåðõíîñòÿõ è èõ ïðèëîæåíèÿ
Êëàññè÷åñêèå è êâàíòîâûå âû÷èñëåíèÿ
Èñêóññòâî ïðîãðàììèðîâàíèÿ äëÿ ÝÂÌ
Àëãîðèòìû: ïîñòðîåíèå è àíàëèç
Ýôôåêòèâíûå àëãîðèòìû è ñëîæíîñòü âû÷èñëåíèé
Òåîðèÿ ñëîæíîñòè
Òåîðèÿ ãðàôîâ
Êîìáèíàòîðíàÿ îïòèìèçàöèÿ. Àëãîðèòìû è
ñëîæíîñòü
Ôóíäàìåíòàëüíûå àëãîðèòìû íà C++
Âåðîÿòíîñòü
237

Powered by TCPDF (www.tcpdf.org)

--">