Victor Valls, Panagiotis Promponas, et al.
IEEE Communications Magazine
Paper
Equivalence of free boolean graphs can be decided probabilistically in polynomial time
Abstract
Natural graphical representations for Boolean functions, so-called free Boolean graphs, arise in the study of Ianov schemes. Fortune, Hopcroft and Schmidt have asked if an algorithm can decide covalence of these free Boolean graphs in poly- time. We show that random polynomial time will suffice.
Related
Xinyi Su, Guangyu He, et al.
Dianli Xitong Zidonghua/Automation of Electric Power Systems
Arun Viswanathan, Nancy Feldman, et al.
IEEE Communications Magazine
Conference paper
Social networks and discovery in the enterprise (SaND)
Inbal Ronen, Elad Shahar, et al.
SIGIR 2009