On some bounds on the size of branching programs (a survey)

Authors:
Elizaveta A. Okol'nishnikova
Affiliations:
Sobolev Institute of Mathematics of Siberian Branch of Russian Academy of Sciences, Novosibirsk, Russia
Venue:
SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications
Year:
2005

Citing 9
Cited 0

The hierarchy of boolean circuits

Computers and Artificial Intelligence
Lower bounds to the complexity of symmetric Boolean functions

Theoretical Computer Science
On lower bounds for read-k-times branching programs

Computational Complexity
On separating the read-k-times branching program hierarchy

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On the nonapproximability of boolean Function by OBDDs and read-k-times Branching Programs

Information and Computation
A Lower Bound on Complexity of Branching Programs (Extended Abstract)

Proceedings of the Mathematical Foundations of Computer Science 1984
Randomness versus Nondeterminism for Read-Once and Read- k Branching Programs

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Lower Bounds for Deterministic and Nondeterministic Branching Programs

FCT '91 Proceedings of the 8th International Symposium on Fundamentals of Computation Theory
On the Hierarchy of Nondeterministic Branching k-Programs

FCT '97 Proceedings of the 11th International Symposium on Fundamentals of Computation Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Previously it was shown by the author that it is possible to reduce obtaining of lower bounds on the complexity of Boolean functions for branching programs without restriction to obtaining of lower bounds on the complexity of minorants of the considered function for branching programs with restriction on the number of occurrences of a variable in a path (read-k-times branching programs). Theorems that reduce the problem of nonlinear lower bounds on the complexity of Boolean functions for branching programs to the problem of lower bounds on the complexity of covering of the set of “ones” of a Boolean function by functions of the defined type or to the problem of obtaining the upper bounds on the number of “ones” of a Boolean function in i-faces of a cube of the defined dimension are presented. A survey of bounds obtained by this method is given.