6568 search results - page 203 / 1314 » Reducing the Complexity of Reductions |
172
click to vote
JSA
2008
15 years 6 months ago
2008
Commercial designs are currently integrating from 10 to 100 embedded processors in a single system on chip (SoC) and the number is likely to increase significantly in the near fut...
197
click to vote
JNCA
2007
15 years 6 months ago
2007
Bluetooth is a new technology for low-cost, low-power, and short-range wireless communication. By constructing a piconet, Bluetooth device establishes link and communicates with o...
142
Voted
COCO
1989
Springer
15 years 10 months ago
1989
Springer
For a monoid G, the iterated multiplication problem is the computation of the product of n elements from G. By re ning known completeness arguments, we show that as G varies over ...
164
click to vote
JAIR
2008
15 years 6 months ago
2008
We investigate the computational complexity of testing dominance and consistency in CP-nets. Up until now, the complexity of dominance has been determined only for restricted clas...
164
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
In this paper we prove that the avalanche problem for the Kadanoff sandpile model (KSPM) is P-complete for two-dimensions. Our proof is based on a reduction from the monotone circ...