1383 search results - page 8 / 277 » On the Complexity of the Interlace Polynomial |
IV
2003
IEEE
15 years 3 months ago
2003
IEEE
In literature exist many links to translation of speech into sign language and links to gesturing with avatars. But the author cannot get any link to a visualization of background...
PKC
2012
Springer
13 years 10 days ago
2012
Springer
Abstract. The Ring-LWE problem, introduced by Lyubashevsky, Peikert, and Regev (Eurocrypt 2010), has been steadily finding many uses in numerous cryptographic applications. Still,...
IFIP
2004
Springer
15 years 3 months ago
2004
Springer
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We ...
IANDC
2006
14 years 10 months ago
2006
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We...
JC
2008
14 years 10 months ago
2008
We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(log(nD(f))) iterations (grid refinements) where n is...