Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Opmanis, Rihards"'
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:
Opmanis, Rihards
Šī darba ietvaros tiks aplūkotas Būla funkcijas un to, cik funkcijas argumentu vērtības jāzina sliktākajā gadījumā, lai varētu noteikt funkcijas vērtību. Tiek aplūkotas funkcijas, kam varētu uzbūvēt kvantu vaicājošo algoritmu, kas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2360::a64e3a4f23299db116bbb0b394406702
https://dspace.lu.lv/dspace/handle/7/6912
https://dspace.lu.lv/dspace/handle/7/6912
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
Publikováno v:
Descriptional Complexity of Formal Systems: 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings; 2015, p293-293, 1p
Publikováno v:
Descriptional Complexity of Formal Systems: 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings; 2015, pI-XII, 12p
Autor:
Pogorelovs, Sergejs
Darbs ir veltīts k-sakarīgu grafu ģenerēšanas jautājumam. Darbā tiek piedāvāti četri algoritmi grafu ģenerēšanai: atkārtota grafu ģenerēšana pēc Erdeša-Renji modeļa ar mērķi iegūt k-sakarīgu grafu; 2-sakarīga grafa izveidoša
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2360::f0247bb3ef9b730b72efaa90676851c5
https://dspace.lu.lv/dspace/handle/7/25041
https://dspace.lu.lv/dspace/handle/7/25041
Autor:
Jeffrey Shallit, Alexander Okhotin
This book constitutes the refereed proceedings of the 17th International Conference on Descriptional Complexity of Formal Systems, DCFS 2015, held in Waterloo, ON, Canada, in June 2015. The 23 full papers presented together with 2 invited talks were