Sciweavers

3913 search results - page 36 / 783
» complexity 2006
Sort
View
PCS
2006
63views more  PCS 2006»
13 years 7 months ago
Discrete relations on abstract simplicial complexes
Relations On Abstract Simplicial Complexes Talk at CASC 2005, Kalamata, Greece Vladimir Kornyak Laboratory of Information Technologies Joint Institute for Nuclear Research 13 Septe...
Vladimir V. Kornyak
MLQ
2007
83views more  MLQ 2007»
13 years 7 months ago
Computing the complexity of the relation of isometry between separable Banach spaces
We compute here the Borel complexity of the relation of isometry between separable Banach spaces, using results of Gao, Kechris [1] and Mayer-Wolf [4]. We show that this relation ...
Julien Melleray
JSC
2006
81views more  JSC 2006»
13 years 7 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 7 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
JCO
2010
100views more  JCO 2010»
13 years 6 months ago
A class of error-correcting pooling designs over complexes
Abstract As a generalization of de-disjunct matrices and (w,r;d)-cover-freefamilies, the notion of (s,l)e-disjunct matrices is introduced for error-correcting pooling designs over ...
Tayuan Huang, Kaishun Wang, Chih-wen Weng