乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T05:07:21Z","timestamp":1740114441574,"version":"3.37.3"},"reference-count":27,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,1,2]],"date-time":"2021-01-02T00:00:00Z","timestamp":1609545600000},"content-version":"vor","delay-in-days":1462,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61472222"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2013FM030"],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1016\/j.tcs.2016.05.040","type":"journal-article","created":{"date-parts":[[2016,6,6]],"date-time":"2016-06-06T19:55:35Z","timestamp":1465242935000},"page":"54-63","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"PA","title":["Approximating Max NAE-k-SAT by anonymous local search"],"prefix":"10.1016","volume":"657","author":[{"given":"Aiyong","family":"Xian","sequence":"first","affiliation":[]},{"given":"Kaiyuan","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Daming","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Lianrong","family":"Pu","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Liu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2016.05.040_br0010","series-title":"Proceedings of WAOA 2005","first-page":"27","article-title":"Improved approximation algorithms for Max NAE-SAT and Max SAT","volume":"vol. 3879","author":"Abidor","year":"2006"},{"issue":"6","key":"10.1016\/j.tcs.2016.05.040_br0020","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/S0020-0190(98)00021-0","article-title":"Better approximation algorithms for set splitting and not-all-equal SAT","volume":"65","author":"Andersson","year":"1998","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"10.1016\/j.tcs.2016.05.040_br0030","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1006\/jagm.2001.1202","article-title":"Improved approximation algorithms for Max-Sat","volume":"42","author":"Asano","year":"2002","journal-title":"J. Algorithms"},{"key":"10.1016\/j.tcs.2016.05.040_br0040","series-title":"Proceedings of AAAI'2012","first-page":"434","article-title":"Configuration checking with aspiration in local search for SAT","author":"Cai","year":"2012"},{"issue":"3","key":"10.1016\/j.tcs.2016.05.040_br0050","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1006\/jcss.1998.1612","article-title":"Tight bound on Johnson's algorithm for maximum satisfiability","volume":"58","author":"Chen","year":"1999","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.tcs.2016.05.040_br0060","series-title":"Proceedings of the 3rd Annual ACM Symposium on Theory of Computing","first-page":"151","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/j.tcs.2016.05.040_br0070","series-title":"Proceedings of the 3rd Israel Symposium on Theory and Computing Systems","first-page":"182","article-title":"Approximating the value of two power proof systems, with applications to Max-2Sat and Max-Dicut","author":"Feige","year":"1995"},{"issue":"4","key":"10.1016\/j.tcs.2016.05.040_br0080","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1137\/S0895480192243516","article-title":"New 3\/4-approximation algorithms for the maximum satisfiability problem","volume":"7","author":"Goemans","year":"1994","journal-title":"SIAM J. Discrete Math."},{"issue":"6","key":"10.1016\/j.tcs.2016.05.040_br0090","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","article-title":"Improved approximation algorithms for maximum cut and satisfiability problems using semi-definite programming","volume":"42","author":"Goemans","year":"1995","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/j.tcs.2016.05.040_br0100","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1145\/130836.130837","article-title":"Efficient local search for very large-scale satisfiability problem","volume":"3","author":"Gu","year":"1992","journal-title":"ACM SIGART Bull."},{"key":"10.1016\/j.tcs.2016.05.040_br0110","series-title":"Proceedings of the 28th Annual ACM Symposium on Theory of Computing","first-page":"1","article-title":"Some optimal inapproximability results","author":"Hastad","year":"1997"},{"issue":"1\u20133","key":"10.1016\/j.tcs.2016.05.040_br0120","first-page":"133","article-title":"Improved approximation for Max Set Splitting and Max NAE SAT","volume":"142","author":"Han","year":"2004","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"10.1016\/j.tcs.2016.05.040_br0150","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/BF02947312","article-title":"An algorithm based on tabu search for satisfiability problem","volume":"17","author":"Huang","year":"2002","journal-title":"J. Comput. Sci. Tech."},{"issue":"3","key":"10.1016\/j.tcs.2016.05.040_br0160","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","article-title":"Approximation algorithms for combinatorial problems","volume":"9","author":"Johnson","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.tcs.2016.05.040_br0170","series-title":"Proceedings of the 38th IEEE Symposium on Foundations of Computer Science","first-page":"406","article-title":"A 7\/8-approximation algorithm for Max 3Sat","author":"Karloff","year":"1997"},{"issue":"1","key":"10.1016\/j.tcs.2016.05.040_br0190","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1137\/S0097539795286612","article-title":"On syntactic versus computational views of approximability","volume":"28","author":"Khanna","year":"1998","journal-title":"SIAM J. Comput."},{"year":"1995","series-title":"Randomized Algorithms","author":"Motwani","key":"10.1016\/j.tcs.2016.05.040_br0200"},{"key":"10.1016\/j.tcs.2016.05.040_br0220","series-title":"Proceedings of the 14th National Conference on Artificial Intelligence (AAAI'97)","first-page":"281","article-title":"Tabu search for SAT","author":"Mazure","year":"1997"},{"key":"10.1016\/j.tcs.2016.05.040_br0230","series-title":"Proceedings Of AAAI'1997","first-page":"321","article-title":"Evidence for invariants in local search","author":"McAllester","year":"1997"},{"issue":"3","key":"10.1016\/j.tcs.2016.05.040_br0240","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."},{"year":"1994","series-title":"Computational Complexity","author":"Papadimitirou","key":"10.1016\/j.tcs.2016.05.040_br0250"},{"key":"10.1016\/j.tcs.2016.05.040_br0260","series-title":"Proceedings of the 10th National Conference on Artificial Intelligence","first-page":"440","article-title":"A new method for solving hard satisfiability problems","author":"Selman","year":"1992"},{"key":"10.1016\/j.tcs.2016.05.040_br0270","series-title":"Proceedings of the AAAI'94","first-page":"337","article-title":"Noise strategies for improving local search","author":"Selman","year":"1994"},{"issue":"2","key":"10.1016\/j.tcs.2016.05.040_br0280","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0004-3702(01)00151-5","article-title":"Local search characteristics of incomplete SAT procedures","volume":"132","author":"Schurmans","year":"2001","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.tcs.2016.05.040_br0290","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1006\/jagm.1994.1045","article-title":"On the approximation of maximum satisfiability","volume":"17","author":"Yannakakis","year":"1994","journal-title":"J. Algorithms"},{"key":"10.1016\/j.tcs.2016.05.040_br0300","series-title":"Proceedings of the 31th Annual ACM Symposium on Theory of Computing","first-page":"679","article-title":"Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems","author":"Zwick","year":"1999"},{"key":"10.1016\/j.tcs.2016.05.040_br0310","series-title":"Proceedings of Cocoon'2011","first-page":"49","article-title":"Tight bounds on local search to approximate the maximum satisfiability problems","volume":"vol. 6842","author":"Zhu","year":"2011"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397516302262?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397516302262?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,1,2]],"date-time":"2021-01-02T01:48:43Z","timestamp":1609552123000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397516302262"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1]]},"references-count":27,"alternative-id":["S0304397516302262"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2016.05.040","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2017,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Approximating Max NAE-k-SAT by anonymous local search","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2016.05.040","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}