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:
“By Time and Age full many things are taught.”
—Aeschylus (525–456 B.C.)
“I would have broke mine eye-strings, cracked them, but
To look upon him, till the diminution
Of space had pointed him sharp as my needle;
Nay, followed him till he had melted from
The smallness of a gnat to air, and then
Have turned mine eye and wept.”
—William Shakespeare (1564–1616)
“. . . A widow bird sat mourning for her love
Upon a wintry bough;
The frozen wind crept on above,
The freezing stream below.”
—Percy Bysshe Shelley (1792–1822)