A Linear Time Algorithm for Recognizing Regular Boolean Functions

Authors:
Kazuhisa Makino
Affiliations:
-
Venue:
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Year:
1999

Citing 8
Cited 0

A new polynomial-time algorithm for linear programming

Combinatorica
Dualization of regular Boolean functions

Discrete Applied Mathematics
An O(mn) algorithm for regular set-covering problems

Theoretical Computer Science
Disjoint products and efficient computation of reliability

Operations Research
Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle

SIAM Journal on Computing
The Maximum Latency and Identification of Positive Boolean Functions

SIAM Journal on Computing
A fast and simple algorithm for identifying 2-monotonic positive Boolean functions

Journal of Algorithms
Complexity theoretic hardness results for query learning

Computational Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

A positive (or monotone) Boolean function is regular if its variables are naturally ordered, left to right, by decreasing strength, so that shifting the non-zero component of any true vector to the left always yields another true vector. In this paper, we propose a simple linear time algorithm to recognize whether a positive function is regular.