Sciweavers

1169 search results - page 39 / 234
» Degrees of monotone complexity
Sort
View
TC
1998
13 years 8 months ago
A New Representation of Elements of Finite Fields GF(2m) Yielding Small Complexity Arithmetic Circuits
—Let F2 denote the binary field and F 2 m an algebraic extension of degree m > 1 over F2 . Traditionally, elements of F 2 m are either represented as powers of a primitive ele...
Germain Drolet
CORR
2008
Springer
127views Education» more  CORR 2008»
13 years 8 months ago
Theory of Rumour Spreading in Complex Social Networks
We introduce a general stochastic model for the spread of rumours, and derive mean-field equations that describe the dynamics of the model on complex social networks (in particula...
Maziar Nekovee, Yamir Moreno, G. Bianconi, M. Mars...
EACL
2009
ACL Anthology
14 years 9 months ago
Parsing Mildly Non-Projective Dependency Structures
We present novel parsing algorithms for several sets of mildly non-projective dependency structures. First, we define a parser for well-nested structures of gap degree at most 1, ...
Carlos Gómez-Rodríguez, David J. Wei...
ISSAC
2007
Springer
147views Mathematics» more  ISSAC 2007»
14 years 2 months ago
Differential equations for algebraic functions
It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their po...
Alin Bostan, Frédéric Chyzak, Bruno ...
FSE
2006
Springer
109views Cryptology» more  FSE 2006»
14 years 12 days ago
Computing the Algebraic Immunity Efficiently
The purpose of algebraic attacks on stream and block ciphers is to recover the secret key by solving an overdefined system of multivariate algebraic equations. They become very eff...
Frédéric Didier, Jean-Pierre Tillich