{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,28]],"date-time":"2024-06-28T07:15:47Z","timestamp":1719558947278},"reference-count":4,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4825,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,5]]},"DOI":"10.1016\/s0304-3975(00)00036-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:38:29Z","timestamp":1027636709000},"page":"495-498","source":"Crossref","is-referenced-by-count":13,"title":["DNF tautologies with a limited number of occurrences of every variable"],"prefix":"10.1016","volume":"238","author":[{"given":"P.","family":"Savick\u00fd","sequence":"first","affiliation":[]},{"given":"Ji\u0159\u0131\u0301","family":"Sgall","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00036-0_BIB1","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0166-218X(90)90020-D","article-title":"On the r,s-SAT satisfiability problem and a conjecture of Tovey","volume":"26","author":"Dubois","year":"1990","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/S0304-3975(00)00036-0_BIB2","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1137\/0222015","article-title":"One more occurrence of variables makes satisfiability jump from trivial to NP-complete","volume":"22","author":"Kratochv\u0131\u0301l","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(00)00036-0_BIB3","unstructured":"J. St\u0159\u0131\u0301brn\u00e1, Between combinatorics and formal logic, Master Thesis, Charles University, Prague, 1994, (see also http:\/\/www.fi.muni.cz\/usr\/stribrna)."},{"key":"10.1016\/S0304-3975(00)00036-0_BIB4","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0166-218X(84)90081-7","article-title":"A simplified satisfiability problem","volume":"8","author":"Tovey","year":"1984","journal-title":"Discrete Appl. Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500000360?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500000360?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T06:53:24Z","timestamp":1555224804000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500000360"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,5]]},"references-count":4,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,5]]}},"alternative-id":["S0304397500000360"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00036-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,5]]}}}