We investigate tradeoffs of various basic complexity measures such as size, space and width. We show examples of formulas that have optimal proofs with respect to any one of these...
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
The importance of tradeoffs between spatial resolution and quantization noise has been examined in our previous work. Subjective experiments indicate that as the bitrate decreases...
Soo Hyun Bae, Thrasyvoulos N. Pappas, Biing-Hwang ...
Bloom filters make use of a "probabilistic" hash-coding method to reduce the amount of space required to store a hash set. A Bloom filter offers a trade-off between its ...
Mark C. Little, Santosh K. Shrivastava, Neil A. Sp...
We present worst-case lower bounds on the minimum size of a binary space partition (BSP) tree as a function of its height, for a set S of n axis-parallel line segments in the plan...