1383 search results - page 56 / 277 » On the Complexity of the Interlace Polynomial |
154
click to vote
CSL
2010
Springer
15 years 6 months ago
2010
Springer
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
134
click to vote
DAGSTUHL
2008
15 years 7 months ago
2008
Abstract. We present algorithmic, complexity and implementation results concerning real root isolation of a polynomial of degree d, with integer coefficients of bit size , using S...
194
click to vote
CSR
2011
Springer
14 years 9 months ago
2011
Springer
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
155
click to vote
IJHPCA
2006
15 years 6 months ago
2006
In this paper, we consider the communications involved in the execution of a complex application, deployed on a heterogeneous platform. Such applications extensively use macro-com...
151
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...