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.

Saved in:
Bibliographic Details
Published in:Cybernetics and systems analysis Vol. 49; no. 2; pp. 183 - 190
Main Authors: Alekseychuk, A. N., Konyushok, S. N.
Format: Journal Article
Language:English
Published: Boston Springer US 01.03.2013
Springer
Springer Nature B.V
Subjects:
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
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:1060-0396
1573-8337
DOI:10.1007/s10559-013-9498-z