231 search results - page 29 / 47 » Algorithms for Quantum Computation: Discrete Logarithms and ... |
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
We present a method by which any polynomial-time randomized distributed algorithm is transformed in such way that each participating process needs only polylog local random bits a...
COMPGEOM
2001
ACM
13 years 11 months ago
2001
ACM
We present two approaches to the problem of calculating a cell in a 3-dimensional arrangement of quadrics. The first approach solves the problem using rational arithmetic. It work...
ASIACRYPT
2007
Springer
14 years 1 months ago
2007
Springer
The black-box field (BBF) extraction problem is, for a given field F, to determine a secret field element hidden in a black-box which allows to add and multiply values in F in ...
STOC
1999
ACM
13 years 12 months ago
1999
ACM
In this paper we prove a theorem that gives an (almost) tight upper bound on the sensitivity of a multiple-output Boolean function in terms of the sensitivity of its coordinates an...
MEMBRANE
2004
Springer
14 years 27 days ago
2004
Springer
Some computational aspects and behavioral patterns of P systems are considered, emphasizing dynamical properties that turn useful in characterizing the behavior of biological and b...