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:
“The first time a woman marries she follows her parents’ wishes, but when she marries again she follows her own.”
—Chinese proverb.
“Here were poor streets where faded gentility essayed with scanty space and shipwrecked means to make its last feeble stand, but tax-gatherer and creditor came there as elsewhere, and the poverty that yet faintly struggled was hardly less squalid and manifest than that which had long ago submitted and given up the game.”
—Charles Dickens (1812–1870)
“There was on old person of Fratton
Who went to church with his hat on.
“If I wake up,” he said,
“With my hat on my head,
I shall know that it hasn’t been sat on.””
—Anonymous.