Hostname: page-component-74656f9884-npj9w Total loading time: 0 Render date: 2026-11-09T05:16:11.091Z Has data issue: false hasContentIssue false
  • English
  • Français

The Clarkson–Shor Technique Revisited and Extended

Published online by Cambridge University Press:  17 March 2003

MICHA SHARIR
MICHA SHARIR
Affiliation:
School of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel and Courant Institute of Mathematical Sciences, New York University, New York, NY 10012, USA (e-mail: sharir@cs.tau.ac.il)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 12 , Issue 2 , March 2003 , pp. 191 - 201
Copyright
2003 Cambridge University Press