1383 search results - page 51 / 277 » On the Complexity of the Interlace Polynomial |
154
click to vote
ECCC
2010
15 years 6 months ago
2010
The IP theorem, which asserts that IP = PSPACE (Lund et. al., and Shamir, in J. ACM 39(4)), is one of the major achievements of complexity theory. The known proofs of the theorem ...
185
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In the independent component analysis, polynomial functions of higher order statistics are often used as cost functions. However, such cost functions usually have many local minim...
154
click to vote
STOC
2010
ACM
16 years 3 months ago
2010
ACM
In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutativ...
145
click to vote
ICCAD
2004
IEEE
16 years 3 months ago
2004
IEEE
Polynomial expressions are used to compute a wide variety of mathematical functions commonly found in signal processing and graphics applications, which provide good opportunities...
147
click to vote
PDCAT
2009
Springer
16 years 21 days ago
2009
Springer
Abstract— In symbolic computation, polynomial multiplication is a fundamental operation akin to matrix multiplication in numerical computation. We present efficient implementati...