PaperEquivalence of free boolean graphs can be decided probabilistically in polynomial timeManuel Blum, Ashok K. Chandra, et al.Information Processing Letters