Selected papers that cite this one
- Eric Allender, Jia Jiao, Meena Mahajan, and V. Vinay. Non-commutative arithmetic circuits: depth reduction and size lower bounds. Theoretical Computer Science, 209(1-2):47-86, 6 December 1998. Fundamental Study.
- Rimli Sengupta. Cancellation is exponentially powerful for computing the determinant. Information Processing Letters, 62(4):177-181, 28 May 1997.
- Rimli Sengupta and H. Venkateswaran. A lower bound for monotone arithmetic circuits computing 0-1 permanent. Theoretical Computer Science, 209(1-2):389-398, 6 December 1998. Note.