{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T18:05:19Z","timestamp":1648749919206},"reference-count":15,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1998,11,1]],"date-time":"1998-11-01T00:00:00Z","timestamp":909878400000},"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,11]]},"DOI":"10.1016\/s0020-0190(98)00157-4","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:25:26Z","timestamp":1049736326000},"page":"167-171","source":"Crossref","is-referenced-by-count":0,"title":["A new lower bound on approximability of the ground state problem for tridimensional Ising spin glasses"],"prefix":"10.1016","volume":"68","author":[{"given":"Roberto","family":"Posenato","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massimo","family":"Santini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(98)00157-4_BIB1","series-title":"Proc. 33rd Annual IEEE Symposium on the Foundations of Computer Science","first-page":"14","article-title":"Proof verification and intractability of approximation problems","author":"Arora","year":"1992"},{"key":"10.1016\/S0020-0190(98)00157-4_BIB2","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(94)00291-P","article-title":"Approximate solution of NP optimization problems","volume":"150","author":"Ausiello","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(98)00157-4_BIB3","doi-asserted-by":"crossref","first-page":"3241","DOI":"10.1088\/0305-4470\/15\/10\/028","article-title":"On the computational complexity of Ising spin glass models","volume":"15","author":"Barahona","year":"1982","journal-title":"J. Phys. A: Math. Gen."},{"issue":"3","key":"10.1016\/S0020-0190(98)00157-4_BIB4","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1006\/jcom.1997.0449","article-title":"Approximability of the ground state problem for certain Ising spin glasses","volume":"13","author":"Bertoni","year":"1997","journal-title":"J. Complexity"},{"key":"10.1016\/S0020-0190(98)00157-4_BIB5","doi-asserted-by":"crossref","first-page":"6719","DOI":"10.1088\/0305-4470\/27\/20\/012","article-title":"On the approximability of the energy function of Ising spin glasses","volume":"27","author":"Bertoni","year":"1994","journal-title":"J. Phys. A: Math. Gen."},{"key":"10.1016\/S0020-0190(98)00157-4_BIB6","article-title":"Approximability of the ground state problem for tridimensional Ising spin glasses","author":"Bertoni","year":"1998"},{"key":"10.1016\/S0020-0190(98)00157-4_BIB7","doi-asserted-by":"crossref","first-page":"2553","DOI":"10.1088\/0305-4470\/13\/8\/005","article-title":"On the ground states of the frustration model of a spin glass by a matching method of graph theory","volume":"13","author":"Bieche","year":"1980","journal-title":"J. Phys. A: Math. Gen."},{"issue":"1\u20132","key":"10.1016\/S0020-0190(98)00157-4_BIB8","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0304-3975(95)00060-7","article-title":"On an approximation measure founded on the links between optimization and polynomial approximation theory","volume":"158","author":"Demange","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(98)00157-4_BIB9","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1088\/0305-4608\/5\/5\/017","article-title":"Theory of spin glasses","volume":"5","author":"Edwards","year":"1975","journal-title":"J. Phys. F."},{"key":"10.1016\/S0020-0190(98)00157-4_BIB10","series-title":"Proc. Tenth Annual ACM Symposium on Theory of Computing","first-page":"114","article-title":"Parallelism in random access machines","author":"Fortune","year":"1978"},{"key":"10.1016\/S0020-0190(98)00157-4_BIB11","series-title":"Proc. International Conference on Automata, Languages and Programming","first-page":"355","article-title":"On enumeration procedures for theorem proving and for integer programming","author":"Galil","year":"1976"},{"key":"10.1016\/S0020-0190(98)00157-4_BIB12","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(98)00157-4_BIB13","series-title":"Computational Complexity","author":"Papadimitriou","year":"1994"},{"key":"10.1016\/S0020-0190(98)00157-4_BIB14","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","article-title":"Optimization, approximation, and complexity classes","volume":"43","author":"Papadimitriou","year":"1991","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(98)00157-4_BIB15","series-title":"Computer Science Logic. 6th Workshop","first-page":"379","article-title":"Solving 3-satisfiability in less than 1, 579n steps","author":"Schiermeyer","year":"1993"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098001574?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098001574?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T16:54:59Z","timestamp":1556643299000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098001574"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,11]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1998,11]]}},"alternative-id":["S0020019098001574"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00157-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,11]]}}}