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:
“As the farmer casts into the ground the finest ears of his grain, the time will come when we too shall hold nothing back, but shall eagerly convert more than we now possess into means and powers, when we shall be willing to sow the sun and the moon for seeds.”
—Ralph Waldo Emerson (1803–1882)
“Shall we now
Contaminate our fingers with base bribes,
And sell the mighty space of our large honors
For so much trash as may be grasped thus?
I had rather be a dog and bay the moon
Than such a Roman.”
—William Shakespeare (1564–1616)
“I am a rose of Sharon, a lily of the valleys. As a lily among brambles, so is my love among maidens. As an apple tree among the trees of the wood, so is my beloved among young men. With great delight I sat in his shadow, and his fruit was sweet to my taste.”
—Bible: Hebrew, Song of Solomon 2:1-3.