1379 search results - page 152 / 276 » The Complexity of the Annihilating Polynomial |
183
click to vote
ECCC
2011
14 years 10 months ago
2011
We show that two complexity classes introduced about two decades ago are equal. ReachUL is the class of problems decided by nondeterministic log-space machines which on every inpu...
328
click to vote
EUROCRYPT
2011
Springer
14 years 10 months ago
2011
Springer
We describe a working implementation of a variant of Gentry’s fully homomorphic encryption scheme (STOC 2009), similar to the variant used in an earlier implementation effort b...
153
click to vote
VTC
2006
IEEE
16 years 13 days ago
2006
IEEE
— In this paper we compare the following two methods of transmit precoding for the multiple antenna broadcast channel: vector perturbation applied to channel inversion (also term...
176
click to vote
RTSS
2002
IEEE
15 years 11 months ago
2002
IEEE
Feasibility analysis of fixed priority systems has been widely studied in the real-time literature and several acceptance tests have been proposed to guarantee a set of periodic ...
153
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these proble...