674 search results - page 3 / 135 » The computational complexity of the parallel knock-out probl... |
DFG
1992
Springer
13 years 11 months ago
1992
Springer
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
ICCS
2003
Springer
14 years 17 days ago
2003
Springer
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
TC
2010
13 years 5 months ago
2010
—In this paper, we investigate data parallelism in exact inference with respect to arbitrary junction trees. Exact inference is a key problem in exploring probabilistic graphical...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
Complex networks capture interactions among entities in various application areas in a graph representation. Analyzing large scale complex networks often answers important question...
IPPS
2000
IEEE
13 years 11 months ago
2000
IEEE
Consider any known sequential algorithm for matrix multiplication over an arbitrary ring with time complexity O N , where 2 3. We show that such an algorithm can be parallelize...