An improved test of Boolean functions for k-dimensionality

A probabilistic test of Boolean functions for k -dimensionality is constructed. The test has a less time complexity and a smaller first kind error probability (with the same upper bound for the second kind error probability) in comparison with a well-known previously proposed test.

Uloženo v:

Podrobná bibliografie
Vydáno v:	Cybernetics and systems analysis Ročník 49; číslo 2; s. 183 - 190
Hlavní autoři:	Alekseychuk, A. N., Konyushok, S. N.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Boston Springer US 01.03.2013 Springer Springer Nature B.V
Témata:	Algorithms Analysis Artificial Intelligence Boolean Boolean functions Codes Complexity Control Cybernetics Errors Hypotheses Mathematical analysis Mathematics Mathematics and Statistics Probabilistic methods Probability Probability theory Processor Architectures Software Engineering/Programming and Operating Systems Studies Systems analysis Systems Theory Upper bounds dimensional function Walsh–Hadamard transform probabilistic algorithm testing property of Boolean functions
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!