2430 search results - page 426 / 486 » Computing Tutte Polynomials |
153
click to vote
PODC
2006
ACM
15 years 8 months ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
116
click to vote
CIKM
2009
Springer
15 years 6 months ago
2009
Springer
Answering queries using views is a well-established technique in databases. In this context, two outstanding problems can be formulated. The first one consists in deciding whethe...
171
click to vote
EUROCRYPT
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new t...
134
click to vote
FOCS
1998
IEEE
15 years 6 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
142
click to vote
STACS
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...