3007 search results - page 298 / 602 » Linear Functional Fixed-points |
128
click to vote
FSE
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We develop several tools to derive linear independent multivariate equations from algebraic S-boxes. By applying them to maximally nonlinear power functions with the inve...
125
click to vote
ESA
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. We show that all algebraic-geometric codes possess a succinct representation that allows for the list decoding algorithms of [15, 7] to run in polynomial time. We do this...
138
click to vote
CIS
2008
Springer
15 years 6 months ago
2008
Springer
In this paper, a method is introduced how to process the Discrete Fourier Transform (DFT) by a singlelayer neural network with a linear transfer function. By implementing the sugg...
121
click to vote
CSR
2008
Springer
15 years 5 months ago
2008
Springer
We define a denotational semantics for Light Affine Logic (LAL) which has the property that denotations of functions are polynomial time computable by construction of the model. Th...
143
click to vote
APPINF
2003
15 years 5 months ago
2003
In this paper we present optimum interval routing algorithms for message passing networks that have topological structure defined by k-caterpillars and maximal outer planar graph...