2681 search results - page 61 / 537 » Problem F |
SPAA
1992
ACM
14 years 1 months ago
1992
ACM
d abstract) Michael Kaufmann Sanguthevar Rajasekaran Jop F. Sibeyn In this paper we present randomized algorithms for kk routing, k-k sorting, and cut through routing on the mesh ...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
We show that any quantum algorithm to decide whether a function f : [n] → [n] is a permutation or far from a permutation must make Ω n1/3 /w queries to f, even if the algorith...
SPIRE
2009
Springer
14 years 3 months ago
2009
Springer
Given a pattern p over an alphabet Σp and a text t over an alphabet Σt, we consider the problem of determining a mapping f from Σp to Σ+ t such that t = f(p1)f(p2) . . . f(pm)....
COMPUTING
1998
13 years 8 months ago
1998
We give some estimates related to nite element multilevel splittings and Sobolev norms of negative order. Basically, results for the positive order case are carried over by dualit...
APPML
2008
13 years 9 months ago
2008
Assume that Au = f (1) is a solvable linear equation in a Hilbert space H, A is a linear, closed, densely defined, unbounded operator in H, which is not boundedly invertible, so p...