Please use this identifier to cite or link to this item:
Title: Reduction of programs execution time for tasks related to sequences or matrices
Authors: Mitsa, Oleksandr
Horoshko, Yurii
Vapnichnyi, Serhii
Keywords: algorithm, sequences, matrices, optimization
Issue Date: 2020
Citation: Mitsa, Oleksandr, Horoshko, Yurii, Vapnichnyi, Serhii, Reduction of programs execution time for tasks related to sequences or matrices. In SHS Web of Conferences, 2020. Vol. 75. p. 04019. EDP Sciences.
Abstract: The article discusses three approaches to reducing runtime of the programs, which are solutions of Olympiad tasks on computer science, related to sequences or matrices. The first approach is based on the representation of some sequences in matrix form and then the program of calculating the members of the sequence will have asymptotics equal to the time complexity of the exponentiation algorithm and will be O(log (n)). The second approach is to upgrade the known code to obtain significant reduction of the program runtime. This approach is very important to know for scientists who write code for scientific researches and are faced with matrix multiplication operations. The third approach is based on reducing time complexity by search for regularities; the author's task is presented and this approach is used to solve it.
Type: Text
Publication type: Стаття
ISSN: 2261-2424
Appears in Collections:Наукові публікації кафедри інформаційних управляючих систем та технологій

Files in This Item:
File Description SizeFormat 
shsconf_ichtml_2020_04019.pdf1.66 MBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.