Affiliation:
1. Univ. Dortmund, Dortmund, Federal Republic of Germany
Abstract
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
k
-clique functions if
k
is fixed, and exponential lower bounds if
k
increases with
n
. Finally, the hierarchy of the classes BP
d
(
P
) of all sequences of Boolean functions that may be computed by
d
-times only branching programs of polynomial size is introduced. It is shown constructively that BP
1
(
P
) is a proper subset of BP
2
(
P
).
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
66 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Streaming and Query Once Space Complexity of Longest Increasing Subsequence;Lecture Notes in Computer Science;2023-12-09
2. Two Source Extractors for Asymptotically Optimal Entropy, and (Many) More;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
3. Symbolic Parity Game Solvers that Yield Winning Strategies;Electronic Proceedings in Theoretical Computer Science;2020-09-20
4. Prolog for Verification, Analysis and Transformation Tools;Electronic Proceedings in Theoretical Computer Science;2020-08-07
5. Read-Once Branching Programs for Tree Evaluation Problems;ACM Transactions on Computation Theory;2019-01-16