{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:01:44Z","timestamp":1743102104470,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540878261"},{"type":"electronic","value":"9783540878278"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87827-8_5","type":"book-chapter","created":{"date-parts":[[2008,9,20]],"date-time":"2008-09-20T13:53:21Z","timestamp":1221918801000},"page":"57-71","source":"Crossref","is-referenced-by-count":0,"title":["Which Symmetric Homogeneous Polynomials Can Be Proved Positive Semi-definite by Difference Substitution Method?"],"prefix":"10.1007","author":[{"given":"Liangyu","family":"Chen","sequence":"first","affiliation":[]},{"given":"Zhenbing","family":"Zeng","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Bertsekas, D.P., Nedi\u0107, A., Ozdaglar, A.E.: Convex analysis and optimization, pp. 25\u201345. Athena Scientific and Tsinghua University Press (2006)"},{"key":"5_CR2","first-page":"1331","volume":"50","author":"S.L. Chen","year":"2007","unstructured":"Chen, S.L., Yao, Y.: Schur Subspace of Real Symmetric Forms and Application. Acta Mathematica Sinica, Chinese Series\u00a050, 1331\u20131348 (2007)","journal-title":"Acta Mathematica Sinica, Chinese Series"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0041-5553(64)90009-6","volume":"4","author":"N.V. Chernikova","year":"1964","unstructured":"Chernikova, N.V.: Algorithm for finding a general formula for the non-negative solutions of a system of linear equations. U.S.S.R Computational Mathematics and Mathematical Physics\u00a04, 151\u2013158 (1964)","journal-title":"U.S.S.R Computational Mathematics and Mathematical Physics"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/0041-5553(65)90045-5","volume":"5","author":"N.V. Chernikova","year":"1965","unstructured":"Chernikova, N.V.: Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities. U.S.S.R Computational Mathematics and Mathematical Physics\u00a05, 228\u2013233 (1965)","journal-title":"U.S.S.R Computational Mathematics and Mathematical Physics"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/0041-5553(68)90115-8","volume":"8","author":"N.V. Chernikova","year":"1968","unstructured":"Chernikova, N.V.: Algorithm for discovering the set of all the solutions of a linear programming problem. U.S.S.R Computational Mathematics and Mathematical Physics\u00a08, 282\u2013293 (1968)","journal-title":"U.S.S.R Computational Mathematics and Mathematical Physics"},{"key":"5_CR6","unstructured":"Fern\u00e1ndez, F., Quinton, P.: Extension of Chernikova\u2019s algorithm for solving general mixed linear programming problems, Technical Report 437, IRISA-Rennes, France (1988)"},{"key":"5_CR7","first-page":"57","volume-title":"Inequalities","author":"G.H. Hardy","year":"1952","unstructured":"Hardy, G.H., Littlewood, J.E., P\u00f3lya, G.: Inequalities, 2nd edn., pp. 57\u201359. Cambridge University Press, Cambridge (1952)","edition":"2"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Huang, F.J., Chen, S.L.: Schur partition for symmetric ternary forms and readable proof to inequalities. In: ISSAC 2005, Beijing, China, pp. 185\u2013192 (2005)","DOI":"10.1145\/1073884.1073911"},{"key":"5_CR9","unstructured":"Rabl, T.: Volume calculation and estimation of parameterized integer polytopes, Diploma Thesis, Universit\u00e4t Passau, German (2006)"},{"key":"5_CR10","unstructured":"Wilde, D.K.: A library for doing polyhedral operations, Technical Report 785, IRISA-Rennes, France (1993)"},{"key":"5_CR11","unstructured":"Verge, H.L.: A note on Chernikova\u2019s algorithm, Technical Report 635, IRISA-Rennes, France (1994)"},{"key":"5_CR12","first-page":"37","volume-title":"ATCM 2005","author":"L. Yang","year":"2005","unstructured":"Yang, L.: Solving harder problems with lesser mathematics. In: Ju, C., Korea, S., Chu, S.-C., et al. (eds.) ATCM 2005, pp. 37\u201346. ATCM Inc., Blacksburg (2005)"}],"container-title":["Lecture Notes in Computer Science","Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87827-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T07:12:18Z","timestamp":1715238738000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87827-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540878261","9783540878278"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87827-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}