29908 search results - page 5832 / 5982 » On the Complexity of |
JASIS
2000
13 years 7 months ago
2000
: This article examines information theory from the aspect of its "conduit metaphor." A historical approach and a close reading of certain texts by Warren Weaver and Nor...
JC
2000
13 years 7 months ago
2000
We rst review thebasic properties of the well knownclasses of Toeplitz, Hankel, Vandermonde, and other related structured matrices and reexamine their correlation to operations wi...
JCNS
2000
13 years 7 months ago
2000
We explore a computationally efficient method of simulating realistic networks of neurons introduced by Knight, Manin, and Sirovich (1996) in which integrate-and-fire neurons are ...
JCSS
2000
13 years 7 months ago
2000
It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic ( 1 1), which allows sentences c...
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...