A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications

2004 ◽  
Vol 38 (6) ◽  
pp. 671-685 ◽  
Author(s):  
Beate Bollig ◽  
Philipp Woelfel
Keyword(s):  
Lower Bound ◽  
Branching Programs

scholarly journals A lower bound for read-once-only branching programs

1987 ◽  
Vol 35 (2) ◽  
pp. 153-162 ◽  
Author(s):  
László Babai ◽  
Péter Hajnal ◽  
Endre Szemerédi ◽  
György Turán
Keyword(s):  
Lower Bound ◽  
Branching Programs

scholarly journals On Ajtai’s Lower Bound Technique for R-way Branching Programs and the Hamming Distance Problem

2000 ◽  
Vol 7 (11) ◽  
Author(s):  
Jakob Pagter
Keyword(s):  
Lower Bound ◽  
Hamming Distance ◽  
Linear Time ◽  
Program Model ◽  
Branching Programs ◽  
Original Proof ◽  
Trade Off ◽  
Time Space ◽  
Distance Problem ◽  
With Memory

In this report we study the proof employed by Miklos Ajtai<br />[Determinism versus Non-Determinism for Linear Time RAMs<br />with Memory Restrictions, 31st Symposium on Theory of <br />Computation (STOC), 1999] when proving a non-trivial lower bound<br />in a general model of computation for the Hamming Distance<br />problem: given n elements: decide whether any two of them have<br />"small" Hamming distance. Specifically, Ajtai was able to show<br />that any R-way branching program deciding this problem using<br />time O(n) must use space Omega(n lg n).<br />We generalize Ajtai's original proof allowing us to prove a<br />time-space trade-off for deciding the Hamming Distance problem<br /> in the R-way branching program model for time between n<br />and alpha n lg n / lg lg n, for some suitable 0 < alpha < 1. In particular we prove<br />that if space is O(n^(1−epsilon)), then time is Omega(n lg n / lg lg n).

scholarly journals A lower bound on branching programs reading some bits twice

1997 ◽  
Vol 172 (1-2) ◽  
pp. 293-301 ◽  
Author(s):  
Petr Savický ◽  
Stanislav Žák
Keyword(s):  
Lower Bound ◽  
Branching Programs
Sign in / Sign up

Export Citation Format

Share Document