Time/space SAT Tradeoff
Currently we have no way to prove that Boolean satisfiability problem (often abbreviated as SAT), which is NP-complete, requires exponential (or at least super-polynomial) time (this is the famous P versus NP problem), or linear (or at least super-logarithmic) space to solve. However, in the context of space-time tradeoff, one can prove that SAT cannot be computed if we apply constraints to both time and space. L. Fortnow, Lipton, D. van Melkebeek, and A. Viglas proved that SAT cannot be computed by a Turing machine that takes at most O steps and at most O cells of its read-write tapes.
Read more about this topic: Richard J. Lipton
Famous quotes containing the words time, space and/or sat:
“We must take precautions against being prematurely honed sharp—since at the same time we are being prematurely honed thin.”
—Friedrich Nietzsche (1844–1900)
“With sturdy shoulders, space stands opposing all its weight to nothingness. Where space is, there is being.”
—Friedrich Nietzsche (1844–1900)
“As I sat before the fire on my fir-twig seat, without walls above or around me, I remembered how far on every hand that wilderness stretched, before you came to cleared or cultivated fields, and wondered if any bear or moose was watching the light of my fire; for Nature looked sternly upon me on account of the murder of the moose.”
—Henry David Thoreau (1817–1862)