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 disparage reason.
But all the time it’s what we’re most concerned with.
There’s will as motor and there’s will as brakes.
Reason is, I suppose, the steering gear.”
—Robert Frost (1874–1963)
“This moment exhibits infinite space, but there is a space also wherein all moments are infinitely exhibited, and the everlasting duration of infinite space is another region and room of joys.”
—Thomas Traherne (1636–1674)
“You have sat too long for any good you have been doing. Depart, I say, and let us have done with you. In the name of God, go!”
—Oliver Cromwell (1599–1658)