1272 search results - page 255 / 255 » The Set Cover with Pairs Problem |
STOC
2005
ACM
15 years 12 months ago
2005
ACM
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
199
click to vote
Publication
he significant increase in the available computational power that took place in recent decades has been accompanied by a growing interest in the application of the evolutionary ap...