A read-once lower bound and a (1,+k)-hierarchy for branching programs-Reference-Cited by-同舟云学术

A read-once lower bound and a (1,+k)-hierarchy for branching programs

Published:2000-05 Issue:1-2 Volume:238 Page:347-362
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Savický P.,Žák S.

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference25 articles.

1. F. Ablayev, Randomization and nondeterminism are incomparable for polynomial ordered binary decision diagrams, Proc. 24th ICALP, Lecture Notes in Computer Science, vol. 1256, Springer, Berlin, 1997, pp. 195–202.

2. The polynomial method and restricted sums of congruence classes;Alon;J. Number Theory,1996

3. A.E. Andreev, J.L. Baskakov, A.E.F. Clementi, J.D.P. Rolim, Small pseudo-random sets yield hard functions: new tight explicit lower bounds for branching programs, Revision 2 of TR97-053, ECCC, Trier.

4. A lower bound for read-once-only branching programs;Babai;J. Comput. Systems Sci.,1987

5. On lower bounds for read-k-times branching programs;Borodin;Comput. Complexity,1993

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Exponential separation between quantum and classical ordered binary decision diagrams, reordering method and hierarchies;Natural Computing;2022-07-26

2. Error-Free Affine, Unitary, and Probabilistic OBDDs;International Journal of Foundations of Computer Science;2021-05-12

3. Read-Once Branching Programs for Tree Evaluation Problems;ACM Transactions on Computation Theory;2019-01-16

4. On the Relative Succinctness of Sentential Decision Diagrams;Theory of Computing Systems;2018-12-10

5. Error-Free Affine, Unitary, and Probabilistic OBDDs;Descriptional Complexity of Formal Systems;2018