117
click to vote
COCO
15 years 8 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 ...
132
click to vote
COCO
15 years 8 months ago
1989 Springer
Kadin [6] showed that if the Polynomial Hierarchy (PH) has infinitely many levels, then for all k, PSAT[k] ⊂ PSAT[k+1]. This paper extends Kadin’s technique and shows that a p...
COCO
15 years 8 months ago
1989 Springer |
Algorithms