Abstract
We present a characterization ofμ-branching programs and a decomposition tree data structure which results from the characterization. We then show how the data structure can be used to test the equivalence of a pair ofn-nodeμ-branching programs inO(nα(n)) time, whereα(n) is a functional inverse of the Ackermann function. In addition, we show that equivalence testing ofkμ-branching programs fork≥3 is co-NP-complete.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
