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:
“When you sued staying,
Then was the time for words; no going then;
Eternity was in our lips and eyes.”
—William Shakespeare (1564–1616)
“Let the space under the first storey be dark, let the water
lap the stone posts, and vivid green slime glimmer
upon them; let a boat be kept there.”
—Denise Levertov (b. 1923)
“a politician is an arse upon
which everyone has sat except a man.”
—E.E. (Edward Estlin)