A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
The Clarkson–Shor Technique Revisited and Extended
2003
Combinatorics, probability & computing
Preserved Fulltext
We provide an alternative, simpler and more general derivation of the Clarkson-Shor probabilistic technique [7] and use it to obtain several extensions and new combinatorial bounds. †
doi:10.1017/s0963548302005527
fatcat:3hkc5opwlrcazijwwdjqyge7ba