{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,6]],"date-time":"2022-12-06T01:31:18Z","timestamp":1670290278451},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,1,23]],"date-time":"2010-01-23T00:00:00Z","timestamp":1264204800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1007\/s10878-009-9286-x","type":"journal-article","created":{"date-parts":[[2010,1,22]],"date-time":"2010-01-22T21:46:31Z","timestamp":1264196791000},"page":"325-338","source":"Crossref","is-referenced-by-count":4,"title":["An improved time-space lower bound for tautologies"],"prefix":"10.1007","volume":"22","author":[{"given":"Scott","family":"Diehl","sequence":"first","affiliation":[]},{"given":"Dieter","family":"van Melkebeek","sequence":"additional","affiliation":[]},{"given":"Ryan","family":"Williams","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,1,23]]},"reference":[{"key":"9286_CR1","first-page":"42","volume-title":"Current trends in theoretical computer science: entering the 21st century","author":"P Beame","year":"2001","unstructured":"Beame P, Pitassi T (2001) Propositional proof complexity: past, present, and future. In: Paun G, Rozenberg G, Salomaa A (eds) Current trends in theoretical computer science: entering the 21st century. World Scientific, Singapore, pp\u00a042\u201370"},{"key":"9286_CR2","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1006\/jcss.1999.1671","volume":"60","author":"L Fortnow","year":"2000","unstructured":"Fortnow L (2000) Time-space tradeoffs for satisfiability. J Comput Syst Sci 60:337\u2013353","journal-title":"J Comput Syst Sci"},{"key":"9286_CR3","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/CCC.2000.856730","volume-title":"Proceedings of the 15th IEEE conference on computational complexity","author":"L Fortnow","year":"2000","unstructured":"Fortnow L, Van Melkebeek D (2000) Time-space tradeoffs for nondeterministic computation. In: Proceedings of the 15th IEEE conference on computational complexity. IEEE Press, New York, pp 2\u201313"},{"key":"9286_CR4","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1145\/1101821.1101822","volume":"52","author":"L Fortnow","year":"2005","unstructured":"Fortnow L, Lipton R, Van Melkebeek D, Viglas A (2005) Time-space lower bounds for satisfiability. J\u00a0ACM 52:835\u2013865","journal-title":"J\u00a0ACM"},{"key":"9286_CR5","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"W Savitch","year":"1970","unstructured":"Savitch W (1970) Relationships between nondeterministic and deterministic tape complexities. J Comput Syst Sci 4:177\u2013192","journal-title":"J Comput Syst Sci"},{"key":"9286_CR6","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1561\/0400000012","volume":"2","author":"D Melkebeek Van","year":"2007","unstructured":"Van Melkebeek D (2007) A survey of lower bounds for satisfiability and related problems. Found Trends Theor Comput Sci 2:197\u2013303","journal-title":"Found Trends Theor Comput Sci"},{"key":"9286_CR7","unstructured":"Williams R (2009) Alternation-trading proofs, linear programming, and lower bounds. Manuscript available at http:\/\/www.cs.cmu.edu\/~ryanw\/automated-lbs.pdf"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9286-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-009-9286-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9286-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:15Z","timestamp":1559276295000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-009-9286-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,23]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["9286"],"URL":"https:\/\/doi.org\/10.1007\/s10878-009-9286-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1,23]]}}}