DC pole | Wartość | Język |
dc.contributor.author | Kozyra, Paweł Marcin | - |
dc.date.accessioned | 2018-10-08T12:26:31Z | - |
dc.date.available | 2018-10-08T12:26:31Z | - |
dc.date.issued | 2018 | - |
dc.identifier.citation | Computational Methods in Science and Technology, Vol. 24, iss. 3 (2018), s. 187–209 | pl_PL |
dc.identifier.issn | 2353-9453 | - |
dc.identifier.uri | http://hdl.handle.net/20.500.12128/6528 | - |
dc.description.abstract | Four algorithms determining all functional square roots (half iterates) and seven algorithms finding one functional
square root of any function f : X ! X defined on a finite set X, if these square roots exist, are presented herein. Time
efficiency of these algorithms depending on the complexity of examined functions is compared and justification of correctness
is given. Moreover, theorems which make finding half iterates possible in some cases or facilitate this task are formulated. | pl_PL |
dc.language.iso | en | pl_PL |
dc.rights | Uznanie autorstwa 3.0 Polska | * |
dc.rights.uri | http://creativecommons.org/licenses/by/3.0/pl/ | * |
dc.subject | functional square root | pl_PL |
dc.subject | half iterate | pl_PL |
dc.subject | iterated function | pl_PL |
dc.title | On Half Iterates of Functions Defined on Finite Sets | pl_PL |
dc.type | info:eu-repo/semantics/article | pl_PL |
dc.identifier.doi | 10.12921/cmst.2018.0000027 | - |
Pojawia się w kolekcji: | Artykuły (WNŚiT)
|