373 search results - page 4 / 75 » On the Iterated Hairpin Completion |
VTC
2010
IEEE
13 years 5 months ago
2010
IEEE
ERSHOV
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. We present an algorithm for generating all polynomial invariants of Psolvable loops with assignments and nested conditionals. We prove termination of our algorithm. The p...
ICCAD
2009
IEEE
13 years 5 months ago
2009
IEEE
Current logic synthesis techniques are ineffective for arithmetic circuits. They perform poorly for XOR-dominated circuits, and those with a high fan-in dependency between inputs ...
COCO
1989
Springer
13 years 11 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 ...
TARK
2009
Springer
14 years 1 months ago
2009
Springer
Brandenburger, Friedenberg, and Keisler provide an epistemic characterization of iterated admissibility (i.e., iterated deletion of weakly dominated strategies) where uncertainty ...