Sciweavers

903 search results - page 77 / 181
» On the reduction of a random basis
Sort
View
ISSAC
2005
Springer
115views Mathematics» more  ISSAC 2005»
15 years 11 months ago
On the complexity of factoring bivariate supersparse (Lacunary) polynomials
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
Erich Kaltofen, Pascal Koiran
ISCAS
2003
IEEE
102views Hardware» more  ISCAS 2003»
15 years 11 months ago
A deterministic dynamic element matching approach to ADC testing
A deterministic dynamic element matching (DEM) approach to ADC testing is introduced and compared with a common random DEM method. With both approaches, a highly non-ideal DAC is ...
Beatriz Olleta, Lance Juffer, Degang Chen, Randall...
EUROCRYPT
2003
Springer
15 years 11 months ago
Nearly One-Sided Tests and the Goldreich-Levin Predicate
Abstract. We study statistical tests with binary output that rarely outputs one, which we call nearly one-sided statistical tests. We provide an efficient reduction establishing im...
Gustav Hast
VLSID
2010
IEEE
211views VLSI» more  VLSID 2010»
15 years 10 months ago
A Combined DOE-ILP Based Power and Read Stability Optimization in Nano-CMOS SRAM
A novel design approach for simultaneous power and stability (static noise margin, SNM) optimization of nanoCMOS static random access memory (SRAM) is presented. A 45nm single-end...
Garima Thakral, Saraju P. Mohanty, Dhruva Ghai, Dh...
DAGSTUHL
2004
15 years 7 months ago
On the Complexity of Parabolic Initial Value Problems with Variable Drift
We study the intrinsic difficulty of solving linear parabolic initial value problems numerically at a single point. We present a worst case analysis for deterministic as well as fo...
Knut Petras, Klaus Ritter