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:
“What time has been wasted during man’s destiny in the struggle to decide what man’s next world will be like! The keener the effort to find out, the less he knew about the present one he lived in.”
—Sean O’Casey (1884–1964)
“For tribal man space was the uncontrollable mystery. For technological man it is time that occupies the same role.”
—Marshall McLuhan (1911–1980)
“I sat in silent musing—
The soft wind waved my hair;
It told me heaven was glorious
And sleeping earth was fair.”
—Emily Brontë (1818–1848)