Precise Estimates for the Time Complexity of Implementing Algorithms of Set-Theoretic Operations in Table Algebras

Algorithms implementing intersection, union, and difference in table algebras are investigated. Modifications of the most widespread algorithms reducing the amount of computations are proposed. Based on the complexities evaluated in the worst case and on the average for the modified algorithms, the...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Cybernetics and systems analysis Ročník 53; číslo 1; s. 1 - 11
Hlavní autoři:	Red’ko, V. N., Buy, D. B., Kanarskaya, I. S., Senchenko, A. S.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.01.2017 Springer Springer Nature B.V
Témata:	Algebra Algorithms Artificial Intelligence Complex systems Complexity Control Cybernetics Estimates Investigations Mathematical analysis Mathematics Mathematics and Statistics Optimization Processor Architectures Software Engineering/Programming and Operating Systems Studies Systems analysis Systems Theory Tables (data) Unions
ISSN:	1060-0396, 1573-8337
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!