6 search results - page 1 / 2 » coco 1989 |
COCO
1989
Springer
13 years 11 months ago
1989
Springer
COCO
1989
Springer
13 years 11 months ago
1989
Springer
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 ...
COCO
1989
Springer
13 years 11 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
2005
Springer
14 years 1 months ago
2005
Springer
Weighted threshold functions with positive weights are a natural generalization of unweighted threshold functions. These functions are clearly monotone. However, the naive way of ...