|
|||||
|
|
Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials |
|
| Authors: | Maurice Jansen |
| Affiliation: | 1.Institute for Theoretical Computer Science,Tsinghua University,Beijing,China |
| Abstract: | The determinantal complexity of a polynomial f(x 1,x 2,…,x n ) is the minimum m such that f=det m (L(x 1,x 2,…,x n )), where L(x 1,x 2,…,x n ) is a matrix whose entries are affine forms in the x i s over some field $mbox {$mbox {. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |