{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T04:27:22Z","timestamp":1778732842690,"version":"3.51.4"},"reference-count":10,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":[[1998,1]]},"DOI":"10.1016\/s0020-0190(97)00223-8","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:32:24Z","timestamp":1049736744000},"page":"1-6","source":"Crossref","is-referenced-by-count":48,"title":["A simplified NP-complete MAXSAT problem"],"prefix":"10.1016","volume":"65","author":[{"given":"Venkatesh","family":"Raman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Ravikumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.Srinivasa","family":"Rao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)00223-8_BIB1","article-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0020-0190(97)00223-8_BIB2","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete graph problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(97)00223-8_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(87)90028-7","article-title":"On the complexity of the Maximum Satisfiability problem for horn formulas","volume":"26","author":"Jaumard","year":"1987","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/S0020-0190(97)00223-8_BIB4","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1137\/S0895480191220836","article-title":"The Minimum Satisfiability Problem","volume":"7","author":"Kohli","year":"1984","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"10.1016\/S0020-0190(97)00223-8_BIB5","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":"Kratochvil","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(97)00223-8_BIB6","series-title":"A systematical approach to 3-SAT decision yielding 3-SAT-decision in less than 1.5045n steps, Manuscript","author":"Kullmann","year":"1995"},{"key":"10.1016\/S0020-0190(97)00223-8_BIB7","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0166-218X(85)90050-2","article-title":"Solving satisfiability in less than 2n steps","volume":"10","author":"Monien","year":"1985","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(97)00223-8_BIB8","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(77)90012-3","article-title":"The Euclidean traveling salesman problem is NP-complete","volume":"4","author":"Papadimitriou","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(97)00223-8_BIB9","series-title":"Proc. 6th Workshop in Computer Science Logic","article-title":"Solving 3-satisfiability in less than 1.579n steps","author":"Schiermeyer","year":"1993"},{"key":"10.1016\/S0020-0190(97)00223-8_BIB10","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0166-218X(84)90081-7","article-title":"A simplified NP-complete satisfiability problem","volume":"8","author":"Tovey","year":"1984","journal-title":"Discrete Appl. Math."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097002238?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097002238?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:27:07Z","timestamp":1556058427000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097002238"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0020019097002238"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00223-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}