6251 search results - page 847 / 1251 » Randomness, Computability, and Density |
227
click to vote
CC
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...
199
click to vote
CN
2006
15 years 7 months ago
2006
We first study the distribution of path duration in multi-hop wireless networks. We show that as the number of hops along a path increases, the path duration distribution can be a...
197
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several furth...
204
click to vote
ENDM
2006
15 years 7 months ago
2006
We consider a dynamic planning problem for paratransit transportation. The focus is on a decision to take one day ahead: which requests to serve with own vehicles, and which reque...
163
click to vote
COMBINATORICS
2007
15 years 7 months ago
2007
We determine the exact and asymptotic number of unlabeled outerplanar graphs. The exact number gn of unlabeled outerplanar graphs on n vertices can be computed in polynomial time,...