COCO
1990
Springer
14 years 8 months ago
1990
Springer
COCO
1990
Springer
14 years 8 months ago
1990
Springer
We show that if the Boolean hierarchy collapses to level k, then the polynomial hierarchy collapses to BH3(k), where BH3(k) is the kth level of the Boolean hierarchy over P 2 . Th...
COCO
1990
Springer
14 years 8 months ago
1990
Springer
COCO
1990
Springer
14 years 8 months ago
1990
Springer
d Abstract) Eric Allender Christopher Wilson Department of Computer Science Department of Computer Rutgers University and Information Science New Brunswick, NJ 08903, USA Universit...
COCO
1990
Springer
14 years 8 months ago
1990
Springer
COCO
1989
Springer
14 years 8 months ago
1989
Springer
COCO
1989
Springer
14 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 ...
COCO
1989
Springer
14 years 8 months ago
1989
Springer
COCO
1989
Springer
14 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...
AAECC
1990
Springer
14 years 8 months ago
1990
Springer
This paper reveals a duality between constructions of two basic cryptographic primitives, pseudo-random string generators and one-way hash functions. Applying the duality, we pres...