Hostname: page-component-848d4c4894-4hhp2 Total loading time: 0 Render date: 2024-05-18T03:20:16.884Z Has data issue: false hasContentIssue false

The Clarkson–Shor Technique Revisited and Extended

Published online by Cambridge University Press:  17 March 2003

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)

Abstract

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.

Type
Research Article
Copyright
2003 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)