215 search results - page 12 / 43 » Quantum computers that can be simulated classically in polyn... |
CSFW
2006
IEEE
14 years 1 months ago
2006
IEEE
Recently, there has been much interest in extending models for simulation-based security in such a way that the runtime of protocols may depend on the length of their input. Findi...
ISTCS
1993
Springer
13 years 12 months ago
1993
Springer
We pursue a particular approach to analog computation, based on dynamical systems of the type used in neural networks research. Our systems have a xed structure, invariant in time...
AAECC
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. In this paper we show that the separable decomposition of a univariate polynomial can be computed in softly optimal time, in terms of the number of arithmetic operations ...
JOC
2000
13 years 7 months ago
2000
The goal of secure multiparty computation is to transform a given protocol involving a trusted party into a protocol without need for the trusted party, by simulating the party am...
CEC
2008
IEEE
14 years 2 months ago
2008
IEEE
—In this paper, we proposed a reduced polynomial neural swarm net (RPNSN) for the task of classification. Classification task is one of the most studied tasks of data mining. In ...