2087 search results - page 129 / 418 » Computation of class numbers of quadratic number fields |
FOCS
1995
IEEE
15 years 1 months ago
1995
IEEE
We prove that if strong pseudorandom number generators exist, then the class of languages that have polynomialsized circuits (P/poly) is not measurable within exponential time, in...
TIT
2011
14 years 4 months ago
2011
Abstract. In this note we report the following computational results on partial spread functions in 8 variables: (i) the numbers of equivalence classes of partial spread functions ...
INFOCOM
2011
IEEE
14 years 1 months ago
2011
IEEE
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
IACR
2011
13 years 9 months ago
2011
In this paper, we study the complexity of secure multiparty computation using only the secure arithmetic black-box of a finite field, counting the cost by the number of secure m...
HUC
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Infrastructures (persistent socio-technical systems over which services are delivered) are normally taken for granted by their users, but are powerful forces of constrain...