Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Agrawal, M., Thierauf, T.: The formula isomorphism problem. SIAM Journal on Computing 30(3), 990–1009 (2000)
2. Böhler, E., Hemaspaandra, E., Reith, S., Vollmer, H.: Equivalence and isomorphism for boolean constraint satisfaction. In: Conference for Computer Science Logic, pp. 412–426 (2002)
3. Böhler, E., Hemaspaandra, E., Reith, S., Vollmer, H.: The complexity of boolean constraint isomorphism. In: Proceedings of the 21st Symposium on Theoretical Aspects of Computer Science, pp. 164–175 (2004)
4. Booth, K.S., Colbourn, C.J.: Problems polynomially equivalent to graph isomorphism. Technical report, CS-77-04, Computer Science Dept., University of Waterloo (1979)
5. Goldmann, M., Russel, A.: The complexity of solving equations over finite groups. Information and Computation 178(1), 253–262 (2002)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献