74 search results - page 12 / 15 » The Complexity of Black-Box Ring Problems |
JSW
2006
13 years 9 months ago
2006
Abstract-- Solving complex real-world problems using evolutionary computation is a CPU time-consuming task that requires a large amount of computational resources. Peerto-Peer (P2P...
ECCC
2011
13 years 4 months ago
2011
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
COCO
2005
Springer
14 years 2 months ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
IPPS
2000
IEEE
14 years 1 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...
PAMI
2010
13 years 7 months ago
2010
—This paper proposes a framework for single-image super-resolution. The underlying idea is to learn a map from input low-resolution images to target high-resolution images based ...