{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,6]],"date-time":"2023-07-06T01:33:29Z","timestamp":1688607209777},"reference-count":11,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2001,9]]},"DOI":"10.1016\/s0020-0190(00)00227-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:35:06Z","timestamp":1027600506000},"page":"243-247","source":"Crossref","is-referenced-by-count":4,"title":["Lower bounds on the complexity of recognizing SAT by Turing machines"],"prefix":"10.1016","volume":"79","author":[{"given":"Rahul","family":"Santhanam","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(00)00227-1_BIB001","series-title":"Conference Record of the Seventh Annual Symposium on Switching and Automata Theory","first-page":"78","article-title":"The recognition problem for the set of perfect squares","author":"Cobham","year":"1966"},{"issue":"1","key":"10.1016\/S0020-0190(00)00227-1_BIB002","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF01744430","article-title":"A time-space tradeoff for language recognition","volume":"17","author":"Duris","year":"1984","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0020-0190(00)00227-1_BIB003","series-title":"Proceedings of the 27th ACM Symposium on the Theory of Computing","first-page":"147","article-title":"A nearly optimal time-space lower bound for directed st-connectivity on the NNJAG model","author":"Edmonds","year":"1995"},{"key":"10.1016\/S0020-0190(00)00227-1_BIB004","series-title":"Proceedings of the 12th Annual IEEE Conference on Computational Complexity","first-page":"52","article-title":"Nondeterministic polynomial time versus nondeterministic logarithmic space: Time-space tradeoffs for satisfiability","author":"Fortnow","year":"1997"},{"key":"10.1016\/S0020-0190(00)00227-1_BIB005","series-title":"Proceedings, Logic at Botik'89","first-page":"108","article-title":"Nearly-linear time","volume":"363","author":"Gurevich","year":"1989"},{"issue":"3","key":"10.1016\/S0020-0190(00)00227-1_BIB006","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1145\/79147.214070","article-title":"Nondeterministic linear-time tasks may require substantially nonlinear deterministic time in the case of sublinear work space","volume":"37","author":"Gurevich","year":"1990","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/S0020-0190(00)00227-1_BIB007","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01744432","article-title":"Towards separating nondeterminism from determinism","volume":"17","author":"Kannan","year":"1984","journal-title":"Math. Systems Theory"},{"issue":"3","key":"10.1016\/S0020-0190(00)00227-1_BIB008","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(86)90150-7","article-title":"Two time-space tradeoffs for element distinctness","volume":"47","author":"Karchmer","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(00)00227-1_BIB009","series-title":"Proceedings of the 40th Annual Symposium on Foundations of Computer Science","first-page":"459","article-title":"On the complexity of SAT","author":"Lipton","year":"1999"},{"key":"10.1016\/S0020-0190(00)00227-1_BIB010","series-title":"Proceedings of the 24th IEEE Symposium on Foundations of Computer Science","first-page":"429","article-title":"On determinism versus non-determinism and related problems","author":"Paul","year":"1983"},{"issue":"5","key":"10.1016\/S0020-0190(00)00227-1_BIB011","doi-asserted-by":"crossref","first-page":"966","DOI":"10.1137\/S0097539788148959","article-title":"Near-optimal time-space tradeoff for element distinctness","volume":"23","author":"Yao","year":"1994","journal-title":"SIAM J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000002271?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000002271?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T17:56:33Z","timestamp":1556214993000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019000002271"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["S0020019000002271"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(00)00227-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}