Selected papers that cite this one
- Qing Guo, Paliath Narendran, and D. A. Wolfram. Complexity of nilpotent unification and matching problems. Accepted for publication in Information and Computation. Final manuscript received for publication September 8, 1998.
- Paliath Narendran. Solving linear equations over polynomial semirings. In Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science, pages 466-472, New Brunswick, New Jersey, 27-30 July 1996. IEEE Computer Society Press.