732 search results - page 60 / 147 » corr 2011 |
137
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
—The standard algebraic decoding algorithm of cyclic codes [n, k, d] up to the BCH bound t is very efficient and practical for relatively small n while it becomes unpractical fo...
131
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
The Quantum Substate Theorem due to Jain, Radhakrishnan, and Sen [7] gives us a powerful operational interpretation of the observational divergence of two quantum states, a quanti...
126
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We prove that the Walksat algorithm from [16, 17] finds a satisfying assignment of Φ in pol...
128
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
We study problems of scheduling jobs on related machines so as to minimize the makespan in the setting where machines are strategic agents. In this problem, each job j has a lengt...
148
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We study cellular automata with respect to a new communication complexity problem: each of two players know half of some finite word, and must be able to tell whether the state o...