{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T19:45:44Z","timestamp":1725479144489},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262763"},{"type":"electronic","value":"9783540316794"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11499107_22","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T17:56:25Z","timestamp":1279130185000},"page":"294-308","source":"Crossref","is-referenced-by-count":2,"title":["Sums of Squares, Satisfiability and Maximum Satisfiability"],"prefix":"10.1007","author":[{"given":"Hans","family":"van Maaren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Linda","family":"van Norden","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","unstructured":"Benson, S.J., Ye, Y.: DSDP5 User guide - The dual-scaling algorithm for semidefinite programming. Technical Report ANL\/MCS-TM-255, Argonne National Laboratory (2005)"},{"key":"22_CR2","unstructured":"Blekherman, G.: There are significantly more nonnegative polynomials than sums of squares. Submitted to Israel Journal of Mathematics (2004)"},{"key":"22_CR3","unstructured":"Borchers, B.: CSDP: A C library for semidefinite programming. Technical report, New Mexico Tech. (1997)"},{"key":"22_CR4","series-title":"Applied Optimization Series","doi-asserted-by":"crossref","DOI":"10.1007\/b105286","volume-title":"Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications","author":"E. Klerk de","year":"2002","unstructured":"de Klerk, E.: Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications. Applied Optimization Series, vol.\u00a065. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"22_CR5","series-title":"Series on Applied Optimization","doi-asserted-by":"crossref","DOI":"10.1007\/b105286","volume-title":"Combinatorial and Global Optimization","author":"E. Klerk de","year":"2002","unstructured":"de Klerk, E., Warners, J.P.: Semidefinite programming relaxations for MAX 2-SAT and 3-SAT: Computational perspectives. In: Pardalos, P.M., Migdalas, A., Burkard, R.E. (eds.) Combinatorial and Global Optimization. Series on Applied Optimization, vol.\u00a014. World Scientific Publishers, Singapore (2002)"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Feige, U., Goemans, M.X.: Approximating the value of two prover proof systems, with applications to MAX2SAT and MAXDICUT. In: Proceedings of the Third Israel Symposium on Theory of Computing and Systems, pp.\u00a0182\u2013189 (1995)","DOI":"10.1109\/ISTCS.1995.377033"},{"key":"22_CR7","unstructured":"Fujisawa, K., Kojima, M., Nakata, K., Yamashita, M.: SDPA(Semidefinite Programming Algorithm): user\u2019s manual. Research Reports on Information Sciences, Ser. B: Operations Research B308, Dept. of Information Sciences, Tokyo Institute of Technology, 2-12-1, Oh-Okayama, Meguro-ku, Tokyo 152, Japan (2002)"},{"issue":"6","key":"22_CR8","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the Assoc. Comput. Mach.\u00a042(6), 1115\u20131145 (1995)","journal-title":"Journal of the Assoc. Comput. Mach."},{"key":"22_CR9","volume-title":"Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science","author":"H. Karloff","year":"1997","unstructured":"Karloff, H., Zwick, U.: A 7\/8-approximation algorithm for MAX 3SAT? In: Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, Miami Beach, FL, USA. IEEE Press, Los Alamitos (1997)"},{"issue":"2","key":"22_CR10","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s10107-003-0387-5","volume":"96","author":"P.A. Parrilo","year":"2003","unstructured":"Parrilo, P.A.: Semidefinite programming relaxations for semialgebraic problems. Mathematical Programming Ser. B\u00a096(2), 293\u2013320 (2003)","journal-title":"Mathematical Programming Ser. B"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","author":"J.F. Sturm","year":"1999","unstructured":"Sturm, J.F.: Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optimization Methods and Software\u00a011\u201312, 625\u2013653 (1999)","journal-title":"Optimization Methods and Software"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11499107_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,16]],"date-time":"2019-03-16T13:35:37Z","timestamp":1552743337000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11499107_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262763","9783540316794"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11499107_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}