1383 search results - page 151 / 277 » On the Complexity of the Interlace Polynomial |
167
click to vote
ANSS
2005
IEEE
16 years 2 days ago
2005
IEEE
When performed on a classical computer, the simulation of quantum circuits is usually an exponential job. The methodology based on Hardware Description Languages is able to isolat...
171
click to vote
LATA
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Kanazawa ([1]) has studied the learnability of several parameterized families of classes of categorial grammars. These classes were shown to be learnable from text, in th...
131
click to vote
COCO
1994
Springer
15 years 10 months ago
1994
Springer
Recent results by Toda, Vinay, Damm, and Valiant have shown that the complexity of the determinant is characterized by the complexity of counting the number of accepting computati...
165
click to vote
ASIACRYPT
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating genus 2 hyperelliptic curves defined over large prime fields and suit...
171
click to vote
CLUSTER
2001
IEEE
15 years 10 months ago
2001
IEEE
In this paper, we revisit the master-slave tasking paradigm in the context of heterogeneous processors. We assume that communications take place in exclusive mode. We present a po...