1383 search results - page 106 / 277 » On the Complexity of the Interlace Polynomial |
156
click to vote
ISSAC
2005
Springer
15 years 12 months ago
2005
Springer
We study the multiplication of multivariate power series. We show that over large enough fields, the bilinear complexity of the product modulo a monomial ideal M is bounded by th...
153
click to vote
ASIACRYPT
1991
Springer
15 years 9 months ago
1991
Springer
In [1] a construction of a block cipher from a single pseudorandom permutation is proposed. In a complexity theoretical setting they prove that this scheme is secure against a pol...
148
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
This paper considers the problem of dualizing a monotone CNF (equivalently, computing all minimal transversals of a hypergraph), whose associated decision problem is a prominent o...
164
click to vote
JSC
2010
15 years 4 months ago
2010
We prove two versions of Stickelberger’s Theorem for positive dimensions and use them to compute the connected and irreducible components of a complex algebraic variety. If the ...
126
click to vote
ISAAC
2009
Springer
16 years 27 days ago
2009
Springer
Abstract. Buhrman, Cleve and Wigderson gave a general communication protocol for block-composed functions f(g1(x1 , y1 ), · · · , gn(xn , yn )) by simulating a decision tree com...