16 search results - page 2 / 4 » The irreducibility of some level 1 Hecke polynomials |
IANDC
2006
13 years 5 months ago
2006
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We...
COCO
1990
Springer
13 years 9 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
1989
Springer
13 years 9 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...
TCC
2004
Springer
13 years 10 months ago
2004
Springer
We consider the problem of threshold secret sharing in groups with hierarchical structure. In such settings, the secret is shared among a group of participants that is partitioned ...
WINE
2009
Springer
13 years 12 months ago
2009
Springer
We study convergence of ε-Nash dynamics in congestion games when delay functions of all resources are similar. Delay functions are said to be similar if their values are within a...