1998 search results - page 169 / 400 » Complexity of the Cover Polynomial |
166
click to vote
ICASSP
2010
IEEE
15 years 5 months ago
2010
IEEE
A design method of a linear-phased, two-dimensional (2-D), twofold symmetric circular shaped filter is presented in this paper. Although the proposed method designs a non-separab...
199
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...
201
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 ...
148
click to vote
CORR
2011
Springer
15 years 28 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...
318
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...