{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T02:56:38Z","timestamp":1648868198366},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,7,1]],"date-time":"2012-07-01T00:00:00Z","timestamp":1341100800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s11390-012-1253-9","type":"journal-article","created":{"date-parts":[[2012,7,13]],"date-time":"2012-07-13T08:31:36Z","timestamp":1342168296000},"page":"668-677","source":"Crossref","is-referenced-by-count":0,"title":["Satisfiability with Index Dependency"],"prefix":"10.1007","volume":"27","author":[{"given":"Hong-Yu","family":"Liang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,7,12]]},"reference":[{"key":"1253_CR1","doi-asserted-by":"crossref","unstructured":"Cook S A. The complexity of theorem proving procedures. In Proc. ACM STOC, May 1971, pp.151\u2013158.","DOI":"10.1145\/800157.805047"},{"issue":"3","key":"1253_CR2","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"B Aspvall","year":"1979","unstructured":"Aspvall B, Plass M\u00a0F, Tarjan R E. A linear-time algorithm for testing the truth of certain quantified boolean formulas. Inf. Process. Lett., 1979, 8(3): 121\u2013123.","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"1253_CR3","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant L\u00a0G. The complexity of computing the permanent. Theoret. Comput. Sci., 1979, 8(2): 189\u2013201.","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"1253_CR4","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant L\u00a0G. The complexity of enumeration and reliability problems. SIAM J. Comput., 1979, 8(3): 410\u2013421.","journal-title":"SIAM J. Comput."},{"issue":"3","key":"1253_CR5","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora S, Lund C, Motwani R, Sudan M, Szegedy M. Proof verification and the hardness of approximation problems. J. ACM, 1998, 45(3): 501\u2013555.","journal-title":"J. ACM"},{"issue":"4","key":"1253_CR6","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1145\/502090.502098","volume":"48","author":"J H\u00e5stad","year":"2001","unstructured":"H\u00e5stad J. Some optimal inapproximability results. J. ACM, 2001, 48(4): 798\u2013859.","journal-title":"J. ACM"},{"issue":"4","key":"1253_CR7","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1145\/321850.321857","volume":"21","author":"L Henschen","year":"1974","unstructured":"Henschen L, Wos L. Unit refutations and Horn sets. J. ACM, 1974, 21(4): 590\u2013605.","journal-title":"J. ACM"},{"issue":"1\u20133","key":"1253_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(83)80027-8","volume":"59","author":"S Yamasaki","year":"1983","unstructured":"Yamasaki S, Doshita S. The satisfiability problem for the class consisting of Horn sentences and some non-Horn sentences in propositional logic. Infor. Control, 1983, 59(1\u20133): 1\u201312.","journal-title":"Infor. Control"},{"key":"1253_CR9","doi-asserted-by":"crossref","unstructured":"Schaefer T\u00a0J. The complexity of satisfiability problems. In Proc. ACM STOC, May 1978, pp.216\u2013226.","DOI":"10.1145\/800133.804350"},{"issue":"4","key":"1253_CR10","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/j.jcss.2008.11.001","volume":"75","author":"E Allender","year":"2009","unstructured":"Allender E, Bauland M, Immerman N, Schnoor H, Vollmer H. The complexity of satisfiability problems: Refining Schaefer\u2019s theorem. J. Comput. System Sci., 2009, 75(4): 245\u2013254.","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"1253_CR11","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0166-218X(84)90081-7","volume":"8","author":"CA Tovey","year":"1984","unstructured":"Tovey C A. A simplified NP-complete satisfiability problem. Discrete Appl. Math., 1984, 8(1): 85\u201389.","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"1253_CR12","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1137\/0222015","volume":"22","author":"J Kratochv\u00edl","year":"1993","unstructured":"Kratochv\u00edl J, Savick\u00fd P, Tuza Z. One more occurrence of variables makes satisfiability jump from trivial to NP-complete. SIAM J. Comput., 1993, 22(1): 203\u2013210.","journal-title":"SIAM J. Comput."},{"key":"1253_CR13","doi-asserted-by":"crossref","unstructured":"Gebauer H, Szab\u00f3 T, Tardos G. The local lemma is tight for SAT. In Proc. the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA), Jan. 2011, pp.664\u2013674.","DOI":"10.1137\/1.9781611973082.52"},{"issue":"2","key":"1253_CR14","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D Lichtenstein","year":"1982","unstructured":"Lichtenstein D. Planar formulae and their uses. SIAM J. Comput., 1982, 11(2): 329\u2013343.","journal-title":"SIAM J. Comput."},{"key":"1253_CR15","doi-asserted-by":"crossref","unstructured":"Monien B, Sudborough I H. Bandwidth constrained NPcomplete problems. In Proc. ACM STOC, May 1981, pp.207\u2013217.","DOI":"10.1145\/800076.802474"},{"key":"1253_CR16","doi-asserted-by":"crossref","unstructured":"Georgiou K, Papakonstantinou P A. Complexity and algorithms for well-structured k-SAT instances. In Proc. the 11th International Conference on Theory and Applications of Satisfiability Testing (SAT), May 2008, pp.105\u2013118.","DOI":"10.1007\/978-3-540-79719-7_10"},{"key":"1253_CR17","unstructured":"Rosen K\u00a0H. Elementary Number Theory and its Applications (5th Edition), Addison Wesley, 2004."},{"issue":"4","key":"1253_CR18","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1090\/S0002-9939-1989-0955458-1","volume":"105","author":"I Borosh","year":"1989","unstructured":"Borosh I, Flahive M, Rubin D, Treybig B. A sharp bound for solutions of linear diophantine equations. P. Am. Math. Soc., 1989, 105(4): 844\u2013846.","journal-title":"P. Am. Math. Soc."},{"issue":"3","key":"1253_CR19","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0012-365X(86)90138-X","volume":"58","author":"I Borosh","year":"1986","unstructured":"Borosh I, Flahive M, Treybig B. Small solution of linear Diophantine equations. Discrete Math., 1986, 58(3): 215\u2013220.","journal-title":"Discrete Math."},{"issue":"116","key":"1253_CR20","doi-asserted-by":"crossref","first-page":"897","DOI":"10.1090\/S0025-5718-1971-0301909-X","volume":"25","author":"GH Bradley","year":"1971","unstructured":"Bradley G\u00a0H. Algorithms for Hermite and Smith normal matrices and linear diophantine equations. Math. Comput., 1971, 25(116): 897\u2013907.","journal-title":"Math. Comput."}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-012-1253-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-012-1253-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-012-1253-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,30]],"date-time":"2019-06-30T21:37:12Z","timestamp":1561930632000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-012-1253-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["1253"],"URL":"https:\/\/doi.org\/10.1007\/s11390-012-1253-9","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7]]}}}