On the complexity of branching programs and decision trees for clique functions

@article{Wegener1988OnTC,
  title={On the complexity of branching programs and decision trees for clique functions},
  author={I. Wegener},
  journal={J. ACM},
  year={1988},
  volume={35},
  pages={461-471}
}
  • I. Wegener
  • Published 1988
  • Computer Science, Mathematics
  • J. ACM
Exponential lower bounds on the complexity of computing the clique functions in the Boolean decision-tree model are proved. For one-time-only branching programs, large polynomial lower bounds are proved for <italic>k</italic>-clique functions if <italic>k</italic> is fixed, and exponential lower bounds if <italic>k</italic> increases with <italic>n</italic>. Finally, the hierarchy of the classes BP<subscrpt><italic>d</italic></subscrpt>(<italic>P</italic>) of all sequences of Boolean functions… Expand
On the complexity of integer multiplication in branching programs with multiple tests and in read-once branching programs with limited nondeterminism
  • Philipp Woelfel
  • Mathematics, Computer Science
  • Proceedings 17th IEEE Annual Conference on Computational Complexity
  • 2002
TLDR
Two well-studied BP models are considered which generalize BP1s by allowing a limited amount of nondeterminism and multiple variable tests, respectively and a lower bound of /spl Omega/(2/sup n/(7k)/) is proved for the complexity of integer multiplication in the (V, k)-BP model. Expand
A read-once branching program lower bound of Ω(2n/4) for integer multiplication using universal hashing
TLDR
Combining results and methods for universal hashing with lower bound techniques for BP1s a lower bound of &OHgr;(2^{n/4}) on the size ofBP1s for integer multiplication is presented in this paper. Expand
Two lower bounds for branching programs
The first result concerns branching programs having width (log n) °{*). We give an f l (n log n~ log log n) lower bound for the size of such branching programs computing almost any symmetric BooleanExpand
Complexity theoretical results for randomized branching programs
TLDR
Lower bound results for randomized OBDDs and randomized syn tactic readk-times branching programs form the main part of this work, where little was known about such randomized variants of branching programs. Expand
A Lower Bound Technique for Restricted Branching Programs and Applications
We present a new lower bound technique for two types of restricted Branching Programs (BPs), namely for read-once BPs (BP1s) with restricted amount of nondeterminism and for (1, + k)-BPs. For thisExpand
New Lower Bounds and Hierarchy Results for Restricted Branching Programs
  • D. Sieling
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 1996
TLDR
It is proved that branching programs in which for each path the number of variables that are tested more than once is bounded by using a new lower bound method become more powerful by increasing by 1. Expand
Two lower bounds for branching programs
1 Abstract. The rst result concerns branching programs having width (log n) O(1). We give an (n log n= log log n) lower bound for the size of such branching programs computing almost any symmetricExpand
Time-Space Tradeoffs for Branching Programs
TLDR
It is obtained that for any k, a function that requires exponential size to be computed by length knq-way branching programs, for some q=q(k) is given, which provides the first nontrivial time?space tradedoff for decision problems in this model. Expand
Average-case complexity of detecting cliques
TLDR
The results show that, in certain models of computation, solving k-CLIQUE in the average case requires Ω( nk/4) resources (moreover, k/4 is tight), and obtain a novel Size Hierarchy Theorem for uniform AC0. Expand
Almost k-wise independence and hard Boolean functions
TLDR
It is observed that there exists a Boolean function in AC0[2] (computable by a depth 3, polynomial-size circuit over the basis {Λ, ⊕, 1}) with the optimal lower bound 2n-log n-O(1) for 1-b.p.'s. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 34 REFERENCES
On the Complexity of Branching Programs and Decision Trees for Clique Functions
  • I. Wegener
  • Mathematics, Computer Science
  • TAPSOFT, Vol.1
  • 1987
TLDR
This work introduces the hierarchy of the classes BPk (P) of all sequences of Boolean functions which may be computed by k-times-only branching programs of polynomial size and proves exponentiallower bounds on the decision tree complexity of clique functions. Expand
Bounds for width two branching programs
Branching programs for the computation of Boolean functions were first studied in the Master's thesis of Masek.7 In a rather straightforward manner they generalize the concept of a decision tree to aExpand
Two lower bounds for branching programs
The first result concerns branching programs having width (log n) °{*). We give an f l (n log n~ log log n) lower bound for the size of such branching programs computing almost any symmetric BooleanExpand
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
TLDR
The method of proof is extended to investigate the complexity of the word problem for a fixed permutation group and show that polynomial size circuits of width 4 also recognize exactly nonuniform NC 1. Expand
More on the Complexity of Slice Functions
  • I. Wegener
  • Mathematics, Computer Science
  • Theor. Comput. Sci.
  • 1986
TLDR
In this paper the theory of slice functions is extended and a monotone representation of each Boolean function whosemonotone complexity is at most a factor n larger than its circuit complexity is presented. Expand
Lower bounds by probabilistic arguments
  • A. Yao
  • Mathematics, Computer Science
  • 24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
  • 1983
TLDR
It is proved that, to compute the majority function of n Boolean variables, the size of any depth-3 monotone circuit must be greater than 2nε, and thesize of any width-2 branching program must have super-polynomial growth. Expand
Time-Space Trade-offs for Branching Programs
  • I. Wegener
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 1986
TLDR
This work proves a new result of this type by presenting an effectively defined Boolean function whose complexity in depth-restricted one-time-only branching programs is exponential while its complexity even in width-2 branching program is polynomial. Expand
On the Complexity of Slice Functions
  • I. Wegener
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1985
TLDR
It is shown in this paper that monotone circuits for slice functions can be understood as special circuits called set circuits, here, disjunction and conjunction are replaced by set union and set intersection. Expand
Exponential lower bounds for restricted monotone circuits
TLDR
It is proved that any such circuit or formula for detecting the existence of cliques in an N-node graph has at least 2Ω(Nε) gates for some ε > 0 independent of N. Expand
Almost optimal lower bounds for small depth circuits
  • J. Håstad
  • Computer Science, Mathematics
  • STOC '86
  • 1986
TLDR
Improved lower bounds for the size of small depth circuits computing several functions are given and it is shown that there are functions computable in polynomial size and depth k but requires exponential size when the depth is restricted to k 1. Expand
...
1
2
3
4
...