1368 search results - page 114 / 274 » Generalized Rook Polynomials |
129
click to vote
CORR
2002
Springer
15 years 4 months ago
2002
Springer
We show that the hitting time of the discrete time quantum random walk on the n-bit hypercube from one corner to its opposite is polynomial in n. This gives the first exponential ...
129
click to vote
ENTCS
2002
15 years 4 months ago
2002
In previous work [14] I introduced a generalised notion of coalgebra that is capable of modelling binary methods as they occur in object-oriented programming. An important problem...
146
click to vote
DAM
1999
15 years 4 months ago
1999
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...
145
click to vote
COLOGNETWENTE
2010
15 years 3 months ago
2010
In this paper we analyze O’Hara’s partition bijection. We present three type of results. First, we show that O’Hara’s bijection can be viewed geometrically as a certain sci...
127
click to vote
TCS
2010
15 years 2 months ago
2010
Abstract. Core computation in data exchange is concerned with materializing the minimal target database for a given source database. Gottlob and Nash have recently shown that the c...