Title
The Clarkson–Shor Technique Revisited and Extended
Abstract
We provide an alternative simpler and more general deriva- tion of the Clarkson-Shor probabilistic technique [4] and use it to obtain in addition several extensions and new combi- natorial bounds.
Year
DOI
Venue
2003
10.1017/S0963548302005527
Symposium on Computational Geometry 2013
Keywords
Field
DocType
new combinatorial bound,general derivation,shor technique revisited,shor probabilistic technique
Discrete mathematics,Combinatorics,Probabilistic logic,Mathematics
Journal
Volume
Issue
ISSN
12
2
0963-5483
ISBN
Citations 
PageRank 
1-58113-357-X
10
0.83
References 
Authors
6
1
Name
Order
Citations
PageRank
Micha Sharir184051183.84