Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

STOC
2002
ACM

favoriteEmaildiscussreport

101views Algorithms» more STOC 2002»

Size space tradeoffs for resolution

14 years 4 months ago

Size space tradeoffs for resolution

Download www.cs.technion.ac.il

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 parameters, but optimizing one parameter must cost an increase in the other. These results have implications to the efficiency (or rather, inefficiency) of some commonly used SAT solving heuristics. Our proof relies on a novel connection of the variable space of a proof to the black-white pebbling measure of an underlying graph.

Eli Ben-Sasson

Real-time Traffic

Algorithms | Basic Complexity Measures | Black-white Pebbling Measure | STOC 2002 |

claim paper

Related Content

» Timespace tradeoffs in resolution superpolynomial lower bounds for superlinear space

» Subjective Image Quality Tradeoffs Between Spatial Resolution and Quantization Noise

» Using Bloom Filters to Speedup Name Lookup in Distributed Systems

» Binary space partitions for axisparallel line segments Sizeheight tradeoffs

» Optimal TimeSpace Tradeoff in Probabilistic Inference

» An Exponential TimeSpace Speedup For Resolution

» Reinterpretable Imager Towards Variable PostCapture Space Angle and Time Resolution in Pho...

» An information theoretic rule for sample size adaptation in particle filtering

» Simultaneous Wire Sizing and Wire Spacing in PostLayout Performance Optimization

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2002
Where	STOC
Authors	Eli Ben-Sasson

Comments (0)