6 citations · 21 across the 24 of their papers we have counts for
1 paper · 2 filters
Debajyoti Bera, Tharrmashastha Sapv
Classical branching programs are studied to understand the space complexity of computational problems. Prior to this work, Nakanishi and Ablayev had separately defined two differen…