2168 search results - page 3 / 434 » Randomized Algorithms and Complexity Theory |
100
click to vote
EUROCRYPT
2012
Springer
13 years 1 months ago
2012
Springer
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
116
click to vote
PODS
2012
ACM
13 years 1 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
CORR
2002
Springer
14 years 11 months ago
2002
Springer
We give a precise definition of "generic-case complexity" and show that for a very large class of finitely generated groups the classical decision problems of group theor...
90
Voted
CORR
2000
Springer
14 years 11 months ago
2000
Springer
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
ISSAC
2007
Springer
15 years 5 months ago
2007
Springer
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...