Sciweavers

207 search results - page 32 / 42
» The Polynomial Method for Random Matrices
Sort
View
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
14 years 7 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
CSR
2011
Springer
12 years 11 months ago
Improving the Space-Bounded Version of Muchnik's Conditional Complexity Theorem via "Naive" Derandomization
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
Daniil Musatov
ICCS
2005
Springer
14 years 27 days ago
A Computational Risk Assessment Model for Breakwaters
: In the reliability-risk assessment, the second order reliability index method and the Conditional Expectation Monte Carlo (CEMC) simulation were interrelated as a new Level III a...
Can Elmar Balas
ASIACRYPT
2000
Springer
13 years 11 months ago
Cryptanalysis of the TTM Cryptosystem
Abstract. In 1985 Fell and Diffie proposed constructing trapdoor functions with multivariate equations [11]. They used several sequentially solved stages. Another idea of building ...
Louis Goubin, Nicolas Courtois
NIPS
1996
13 years 8 months ago
Combinations of Weak Classifiers
To obtain classification systems with both good generalizat`ion performance and efficiency in space and time, we propose a learning method based on combinations of weak classifiers...
Chuanyi Ji, Sheng Ma