1383 search results - page 136 / 277 » On the Complexity of the Interlace Polynomial |
155
click to vote
STOC
2010
ACM
16 years 3 months ago
2010
ACM
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
189
click to vote
EUROGRAPHICS
2010
Eurographics
16 years 1 months ago
2010
Eurographics
Higher-order finite element methods have emerged as an important discretization scheme for simulation. They are increasingly used in contemporary numerical solvers, generating a ...
167
click to vote
ITSL
2008
15 years 8 months ago
2008
In this paper we present a randomized complexity theoretic model for those epidemics propagated via short-distance close contact. We prove that the contact-based epidemics problems...
144
click to vote
DCC
2004
IEEE
16 years 6 months ago
2004
IEEE
A steepest descent based bit allocation method with polynomial iteration complexity for minimizing the sum of frame distortions under a total bit rate constraint is presented for ...
147
click to vote
ISSAC
2009
Springer
16 years 1 months ago
2009
Springer
We show that detecting real roots for honestly n-variate (n + 2)-nomials (with integer exponents and coefficients) can be done in time polynomial in the sparse encoding for any ...