Author:
Arnold Stefan,Torán Jacobo
Publisher
Springer International Publishing
Reference20 articles.
1. Lecture Notes in Computer Science;M Agrawal,2007
2. Blum, M., Chandra, A.K., Wegman, M.N.: Equivalence of free boolean graphs can be decided probabilistically in polynomial time. Inf. Process. Lett. 10, 80–82 (1980)
3. Randal, E.: Bryant: graph based algorithms for Boolean function manipulation. IEEE Trans. Comput. 35, 677–691 (1986)
4. Chari, S., Rohatgi, P., Srinivasan, A.: Randomness-optimal unique element isolation with applications to perfect matching and related problems. SIAM J. Comput. 24, 1036–1050 (1995)
5. Darwiche, A.: Compiling knowledge into decomposable negation normal form. In: Proceedings of the 16th International Joint Conference on Artifical Intelligence (IJCAI 1999), pp. 284–289 (1999)