Saha, Chandan ; Saptharishi, Ramprasad ; Saxena, Nitin (2013) A Case of Depth-3 Identity Testing, Sparse Factorization and Duality Computational Complexity, 22 (1). pp. 39-69. ISSN 1016-3328
Full text not available from this repository.
Official URL: http://doi.org/10.1007/s00037-012-0054-4
Related URL: http://dx.doi.org/10.1007/s00037-012-0054-4
Abstract
The polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural cases of identity testing—first is a case of depth-3 PIT, the other of depth-4 PIT.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Springer Nature Switzerland AG. |
| ID Code: | 122746 |
| Deposited On: | 12 Aug 2021 12:55 |
| Last Modified: | 12 Aug 2021 12:55 |
Repository Staff Only: item control page
