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:
“Women had to deal with the men’s response when the women wanted more time “out” of the home; men now must deal with the women’s response as men want more time “in.””
—Kyle D. Pruett (20th century)
“As photographs give people an imaginary possession of a past that is unreal, they also help people to take possession of space in which they are insecure.”
—Susan Sontag (b. 1933)
“By the rivers of Babylon, there we sat down, yea, we wept: when we remembered Zion.”
—Bible: Hebrew Psalms, 137:1.