Sciweavers

29908 search results - page 56 / 5982
» On the Complexity of
Sort
View
JSC
2006
81views more  JSC 2006»
13 years 9 months ago
Complexity bounds for zero-test algorithms
In this paper, we analyze the complexity of a zero test for expressions built from formal power series solutions of first order differential equations with non degenerate initial ...
Joris van der Hoeven, John Shackell
IPL
2000
98views more  IPL 2000»
13 years 8 months ago
Linear complexity of the Naor-Reingold pseudo-random function
We obtain an exponential lower bound on the non-linear complexity of the new pseudo-random function, introduced recently by M. Naor and O. Reingold. This bound is an extension of t...
Igor Shparlinski
JASSS
2002
85views more  JASSS 2002»
13 years 8 months ago
"Methodological Implications of Complex Systems Approaches to Sociality": Some Further Remarks
In a paper published in JASSS, Chris Goldspink discusses the methodological implications of complex systems approaches to the modeling of social systems. Like others before him Go...
Kurt A. Richardson
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 7 months ago
Computational Complexity of Iterated Maps on the Interval
The exact computation of orbits of discrete dynamical systems on the interval is considered. Therefore, a multiple-precision floating point approach based on error analysis is ch...
Christoph Spandl
TCOM
2011
108views more  TCOM 2011»
13 years 3 months ago
Computational Complexity of Decoding Orthogonal Space-Time Block Codes
— The computational complexity of optimum decoding for an orthogonal space-time block code is quantified. Four equivalent techniques of optimum decoding which have the same comp...
Ender Ayanoglu, Erik G. Larsson, Eleftherios Karip...