1383 search results - page 129 / 277 » On the Complexity of the Interlace Polynomial |
197
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
Computing the Dodgson Score of a candidate in an election is a hard computational problem, which has been analyzed using classical and parameterized analysis. In this paper we reso...
186
click to vote
MOBIHOC
2010
ACM
15 years 4 months ago
2010
ACM
Passive monitoring utilizing distributed wireless sniffers is an effective technique to monitor activities in wireless infrastructure networks for fault diagnosis, resource manage...
199
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Abstract—We consider a certain class of large random matrices, composed of independent column vectors with zero mean and different covariance matrices, and derive asymptotically ...
147
click to vote
CORR
2011
Springer
15 years 26 days ago
2011
Springer
Abstract. We present a deep embedding of Bellantoni and Cook’s syntactic characterization of polytime functions. We prove formally that it is correct and complete with respect to...
317
click to vote
AMW
2011
14 years 10 months ago
2011
Abstract. We consider the problem of checking equivalence of conjunctive queries with inequalities under bag (multiset) semantics. The problem is known to be decidable in pspace an...