536 search results - page 25 / 108 » Some Lower Bounds for the Complexity of Continuation Methods |
ICCD
2008
IEEE
14 years 5 months ago
2008
IEEE
— The amount of time and resources that have to be spent on debugging of embedded cores continuously increases. Approaches valid 10 years ago can no longer be used due to the var...
CRYPTO
2001
Springer
14 years 29 days ago
2001
Springer
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
DAGSTUHL
2004
13 years 9 months ago
2004
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...
AMC
2005
13 years 8 months ago
2005
In this paper, a Fourier spectral method for numerically solving Cahn-Hilliard equation with periodic boundary conditions is developed. We establish their semi-discrete and fully d...
CIE
2007
Springer
14 years 2 months ago
2007
Springer
We survey our current knowledge of circuit complexity of regular languages and we prove that regular languages that are in AC0 and ACC0 are all computable by almost linear size ci...