Publisher
Springer Berlin Heidelberg
Reference4 articles.
1. M. Garey and D. S. Johnson. Computers and intractability: a guide to the theory of
NP-completeness. Freeman, San Francisco, California, 1979.
2. Lect Notes Comput Sci;C. Hoffmann,1981
3. Dexter Kozen. Complexity of finitely presented algebras. In Conference Record of the Ninth Annual ACM Symposium on Theory of Computing, pages 164–177, Boulder, Colorado, 2–4 May 1977.
4. Gary L. Miller. Graph isomorphism, general remarks. Journal of Computer and System Sciences, 18:128–142, 1979.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Note on Symmetry Heuristics in SEM;Automated Deduction—CADE-18;2002