The Isomorphism Problem for One-time-only Branching Programs and Arithmetic Circuits


We investigate the computational complexity of the isomorphism problem for one-time-only branching programs (1-BPI): on input of two one-time-only branching programs B 0 and B 1 , decide whether there exists a permutation of the variables of B 1 such that it becomes equivalent to B 0. Our main result is that 1-BPI cannot be NP-hard unless the polynomial… (More)


  • Presentations referencing similar topics