{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,27]],"date-time":"2023-06-27T17:29:08Z","timestamp":1687886948923},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,6,4]],"date-time":"2018-06-04T00:00:00Z","timestamp":1528070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["comput. complex."],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s00037-018-0169-3","type":"journal-article","created":{"date-parts":[[2018,6,4]],"date-time":"2018-06-04T11:55:54Z","timestamp":1528113354000},"page":"595-616","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On semiring complexity of Schur polynomials"],"prefix":"10.1007","volume":"27","author":[{"given":"Sergey","family":"Fomin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dima","family":"Grigoriev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dorian","family":"Nogneng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c9ric","family":"Schost","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,4]]},"reference":[{"issue":"1","key":"169_CR1","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0001-8708(82)90029-9","volume":"43","author":"Bj\u00f6rner Anders","year":"1982","unstructured":"Anders Bj\u00f6rner, Michelle Wachs (1982) Bruhat order of Coxeter groups and shellability. Adv. in Math. 43(1): 87\u2013100","journal-title":"Adv. in Math."},{"issue":"1","key":"169_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/S0002-9947-1988-0946427-X","volume":"308","author":"Bj\u00f6rner Anders","year":"1988","unstructured":"Anders Bj\u00f6rner, Michelle L. Wachs (1988) Generalized quotients in Coxeter groups. Trans. Amer. Math. Soc. 308(1): 1\u201337","journal-title":"Trans. Amer. Math. Soc."},{"key":"169_CR3","unstructured":"Cy P. Chan, Vesselin Drensky, Alan Edelman, Raymond Kan & Plamen Koev (2008). On computing Schur functions and series thereof, preprint."},{"issue":"253","key":"169_CR4","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1090\/S0025-5718-05-01780-1","volume":"75","author":"Demmel James","year":"2006","unstructured":"James Demmel, Plamen Koev (2006) Accurate and efficient evaluation of Schur and Jack functions. Math. Comp. 75(253): 223\u2013239","journal-title":"Math. Comp."},{"issue":"1","key":"169_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10208-014-9231-y","volume":"16","author":"Fomin Sergey","year":"2016","unstructured":"Sergey Fomin, Dima Grigoriev, Gleb Koshevoy (2016) Subtraction-free complexity, cluster transformations, and spanning trees. Found. Comput. Math. 16(1): 1\u201331","journal-title":"Found. Comput. Math."},{"key":"169_CR6","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.jsc.2015.05.005","volume":"74","author":"Grigoriev Dima","year":"2016","unstructured":"Dima Grigoriev, Gleb Koshevoy (2016) Complexity of tropical Schur polynomials. J. Symbolic Comput. 74: 46\u201354","journal-title":"J. Symbolic Comput."},{"issue":"3","key":"169_CR7","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1145\/322326.322341","volume":"29","author":"Jerrum Mark","year":"1982","unstructured":"Mark Jerrum, Marc Snir (1982) Some exact complexity results for straight-line computations over semirings. J. Assoc. Comput. Mach. 29(3): 874\u2013897","journal-title":"J. Assoc. Comput. Mach."},{"issue":"3","key":"169_CR8","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1137\/04061903X","volume":"29","author":"Koev Plamen","year":"2007","unstructured":"Plamen Koev (2007) Accurate computations with totally nonnegative matrices. SIAM J. Matrix Anal. Appl. 29(3): 731\u2013751","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"169_CR9","unstructured":"Ian G. Macdonald (2015). Symmetric functions and Hall polynomials. Oxford University Press, New York, 2nd edition."},{"issue":"3","key":"169_CR10","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10801-006-0008-5","volume":"24","author":"Narayanan Hariharan","year":"2006","unstructured":"Hariharan Narayanan (2006) On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients. J. Algebraic Combin. 24(3): 347\u2013354","journal-title":"J. Algebraic Combin."},{"issue":"1","key":"169_CR11","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/0021-8693(82)90280-0","volume":"77","author":"Proctor Robert A.","year":"1982","unstructured":"Robert A. Proctor (1982) Classical Bruhat orders and lexicographic shellability. J. Algebra 77(1): 104\u2013126","journal-title":"J. Algebra"},{"issue":"3","key":"169_CR12","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0304-3975(76)90083-9","volume":"2","author":"Schnorr Claus-Peter","year":"1976","unstructured":"Claus-Peter Schnorr (1976) A lower bound on the number of additions in monotone computations. Theoret. Comput. Sci. 2(3): 305\u2013315","journal-title":"Theoret. Comput. Sci."},{"key":"169_CR13","unstructured":"Eli Shamir & Marc Snir (1977). Lower bounds on the number of multiplications and the number of additions in monotone computations. Technical Report RC-6757, IBM."},{"key":"169_CR14","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511609589","volume-title":"Enumerative combinatorics. Vol. 2","author":"Stanley Richard P.","year":"1999","unstructured":"Richard P. Stanley (1999) Enumerative combinatorics. Vol. 2. Cambridge University Press, Cambridge"},{"key":"169_CR15","doi-asserted-by":"crossref","unstructured":"Volker Strassen (1972\/73). Die Berechnungskomplexit\u00e4t von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten. Numer. Math. 20, 238\u2013251.","DOI":"10.1007\/BF01436566"},{"key":"169_CR16","first-page":"184","volume":"264","author":"Strassen Volker","year":"1973","unstructured":"Volker Strassen (1973) Vermeidung von Divisionen. J. Reine Angew. Math. 264: 184\u2013202","journal-title":"J. Reine Angew. Math."},{"issue":"3","key":"169_CR17","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0304-3975(80)90060-2","volume":"12","author":"Valiant Leslie G.","year":"1980","unstructured":"Leslie G. Valiant (1980) Negation can be exponentially powerful. Theoret. Comput. Sci. 12(3): 303\u2013314","journal-title":"Theoret. Comput. Sci."},{"key":"169_CR18","doi-asserted-by":"crossref","unstructured":"Michelle L. Wachs (2007). Poset topology: tools and applications. In Geometric combinatorics, volume 13 of IAS\/Park City Math. Ser., 497\u2013615. Amer. Math. Soc., Providence, RI.","DOI":"10.1090\/pcms\/013\/09"}],"container-title":["computational complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00037-018-0169-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-018-0169-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-018-0169-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T19:19:48Z","timestamp":1559589588000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00037-018-0169-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,4]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["169"],"URL":"https:\/\/doi.org\/10.1007\/s00037-018-0169-3","relation":{},"ISSN":["1016-3328","1420-8954"],"issn-type":[{"value":"1016-3328","type":"print"},{"value":"1420-8954","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,4]]},"assertion":[{"value":"20 February 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 June 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}