3680 search results - page 367 / 736 » cases 2010 |
164
click to vote
ECCC
2006
15 years 6 months ago
2006
We investigate the computational complexity of finding an element of a permutation group H Sn with a minimal distance to a given Sn, for different metrics on Sn. We assume that...
171
click to vote
ECCC
2006
15 years 6 months ago
2006
We give new constructions of randomness extractors and lossless condensers that are optimal to within constant factors in both the seed length and the output length. For extractor...
190
Voted
ENTCS
2006
15 years 6 months ago
2006
We report on an experiment in combining Isabelle with automatic first-order arithmetic provers to increase automation on the verification of distributed protocols. As a case study...
143
click to vote
ENTCS
2006
15 years 6 months ago
2006
The standard translation of a Bounded Model Checking (BMC) instance into a satisfiability problem, (a.k.a SAT), might produce misleading results in the case when the model under v...
200
click to vote
ENTCS
2006
15 years 6 months ago
2006
It is reasonable to assume that quantum computations take place under the control of the classical world. For modelling this standard situation, we introduce a Classically-control...