1383 search results - page 45 / 277 » On the Complexity of the Interlace Polynomial |
102
click to vote
MFCS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
COCO
2005
Springer
15 years 5 months ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
102
click to vote
MOC
2011
14 years 6 months ago
2011
We present a new technique, based on polynomial continuation, for solving systems of n polynomials in N complex variables. The method allows equations to be introduced one-by-one o...
JCP
2007
14 years 11 months ago
2007
— This work presents a mathematical framework for the development of efficient algorithms for cyclic convolution computations. The framework is based on the Chinese Reminder Theo...
114
click to vote
FOCS
1998
IEEE
15 years 4 months ago
1998
IEEE
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...