Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Čerņenoks, Juris"'
We consider representing of natural numbers by expressions using 1's, addition, multiplication and parentheses. $\left\| n \right\|$ denotes the minimum number of 1's in the expressions representing $n$. The logarithmic complexity $\left\| n \right\|
Externí odkaz:
http://arxiv.org/abs/1409.0446
Autor:
Iraids, Jānis, Balodis, Kaspars, Čerņenoks, Juris, Opmanis, Mārtiņš, Opmanis, Rihards, Podnieks, Kārlis
We consider representing of natural numbers by arithmetical expressions using ones, addition, multiplication and parentheses. The (integer) complexity of n -- denoted by ||n|| -- is defined as the number of ones in the shortest expressions representi
Externí odkaz:
http://arxiv.org/abs/1203.6462
Autor:
ČERŅENOKS, Juris, CIBULIS, Andrejs
Publikováno v:
Baltic Journal of Modern Computing; 2018, Vol. 6 Issue 2, p96-106, 11p
Autor:
Čerņenoks, Juris
Maģistra darbā risinātas dažas kombinatoriskās ģeometrijas problēmas par tetradiem un pakošanas problēma ar V-pentakubiem. Šo problēmu risināšanai ir izstrādātas speciālas datorprogrammas un iegūti vairāki jauni rezultāti: ir atras
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2360::00f0036e718763576181d554115e9889
https://dspace.lu.lv/dspace/handle/7/19637
https://dspace.lu.lv/dspace/handle/7/19637
Publikováno v:
Descriptional Complexity of Formal Systems: 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings; 2015, p58-69, 12p