| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9501305 | Journal of Complexity | 2005 | 4 Pages |
Abstract
Thiémard (J. Complexity 17(4) (2001) 850) suspects that his upper bound for the discrepancy B(P,xâ) is bounded below by a measure for the tightness of the partition P. We present a counterexample but also prove that for a certain class of partitions the assumption is valid. The partitions used in Thiémard's algorithm are all part of this class.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Analysis
Authors
Tim Pillards, Ronald Cools,