Subject
General Computer Science,Theoretical Computer Science
Reference16 articles.
1. The complexity of searching implicit graphs;Balcázar;Artificial Intelligence,1996
2. Computational complexity of term-equivalence;Bergman;Internat. J. Algebra Comput.,1999
3. A course in universal algebra;Burris,1981
4. Elwyn Berlekamp, David Wolfe, Mathematical Go, A K Peters Ltd., Wellesley, MA, 1994, Chilling gets the last point, With a foreword by James Davies. MR1274921 (95i:90131)
5. A remark on homogeneous experiments with finite automata;Černý;Mat.-Fyz. Časopis Sloven. Akad. Vied,1964
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献