Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Stoyan Kapralov"'
Publikováno v:
Mathematical and Software Engineering, Vol 4, Iss 2, Pp 24-27 (2018)
The proposed research explores the possibilities of applying some base algorithms for sorting to the process of finding a convex in order to optimize the time indicators of this process. A comparative analysis of the time characteristics has been per
Externí odkaz:
https://doaj.org/article/7f2206ea101e4f41baddf718e3f3d73f
Autor:
Stefka Bouyuklieva, Stoyan Kapralov
The CompMath competition is presented. Several problems are presented with multiple solutions with computer algebra system Mathematica. This work was supported in part by Grant 1909C/2020 of the Technical University of Gabrovo, and Grant FSD-31-299-0
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9d318849bc2fe214e4ba446e201de4e2
https://hdl.handle.net/10525/4231
https://hdl.handle.net/10525/4231
Publikováno v:
Engaging Young Students in Mathematics through Competitions — World Perspectives and Practices
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3be7c549b5291b14808f2be1f4076fd2
https://doi.org/10.1142/9789811209826_0012
https://doi.org/10.1142/9789811209826_0012
Publikováno v:
EDULEARN Proceedings.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::45fae25c7d9e18b80c6188ebcd5ce8cd
https://doi.org/10.21125/edulearn.2019.2480
https://doi.org/10.21125/edulearn.2019.2480
Publikováno v:
EDULEARN Proceedings.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b773345b328a145a7c0df6fc8d17d2f7
https://doi.org/10.21125/edulearn.2019.2579
https://doi.org/10.21125/edulearn.2019.2579
Autor:
Valentina Dyankova, Stoyan Kapralov
Publikováno v:
EMS
The goal of this paper is to differentiate and apply the idiosyncratic and significant characteristics of the structuring and formalization of systems of discrete events in a methodological approach to the building of discrete imitational models. Thi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dd98cba36169c8a712645ea45e1a8d64
https://doi.org/10.1109/ems.2012.50
https://doi.org/10.1109/ems.2012.50
Publikováno v:
Designs, Codes and Cryptography. 4:57-67
Recently Jungnickel and Tonchev have shown that there exist at least four inequivalent binary selfcomplementary [28, 7, 12] codes and have asked if there are other [28, 7] codes with weight distributionA0=A28=1,A12=A16=63. In the present paper we giv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9cc2f8fc3d87a937c7fa493271aff251
https://doi.org/10.1007/bf01388560
https://doi.org/10.1007/bf01388560