{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T01:10:01Z","timestamp":1749690601881,"version":"3.41.0"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2016,11,5]],"date-time":"2016-11-05T00:00:00Z","timestamp":1478304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s11590-016-1092-7","type":"journal-article","created":{"date-parts":[[2016,11,5]],"date-time":"2016-11-05T06:49:59Z","timestamp":1478328599000},"page":"1757-1765","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A note on counting independent terms in asymptotic expressions of computational complexity"],"prefix":"10.1007","volume":"11","author":[{"given":"Fabiano de S.","family":"Oliveira","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1010-7170","authenticated-orcid":false,"given":"Valmir C.","family":"Barbosa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,5]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Goldsmith, S.F., Aiken, A.S., Wilkerson, D.S.: In Proc. ESEC-FSE 2007, pp. 395\u2013404 (2007)","key":"1092_CR1","DOI":"10.1145\/1287624.1287681"},{"doi-asserted-by":"crossref","unstructured":"Burnim, J., Juvekar, S., Sen, K.: In Proc. ICSE 2009, pp. 463\u2013473 (2009)","key":"1092_CR2","DOI":"10.1109\/ICSE.2009.5070545"},{"doi-asserted-by":"crossref","unstructured":"Zaparanuks, D., Hauswirth, M.: In Proc. PLDI 2012, pp. 67\u201376 (2012)","key":"1092_CR3","DOI":"10.1145\/2345156.2254074"},{"doi-asserted-by":"crossref","unstructured":"Coppa, E., Demetrescu, C., Finocchi, I.: IEEE T. Software Eng. 40:1185 (2014)","key":"1092_CR4","DOI":"10.1109\/TSE.2014.2339825"},{"key":"1092_CR5","volume-title":"Orders of infinity: The \u2018infinit\u00e4rcalc\u00fcl\u2019 of Paul du Bois-Reymond","author":"GH Hardy","year":"1924","unstructured":"Hardy, G.H.: Orders of infinity: The \u2018infinit\u00e4rcalc\u00fcl\u2019 of Paul du Bois-Reymond, 2nd edn. Cambridge University Press, Cambridge (1924)","edition":"2"},{"key":"1092_CR6","volume-title":"Concrete mathematics: a foundation for computer science","author":"RL Graham","year":"1989","unstructured":"Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete mathematics: a foundation for computer science, 2nd edn. Addison-Wesley, Reading (1989)","edition":"2"},{"key":"1092_CR7","volume-title":"Combinatorial optimization: polyhedra and efficiency, vol A\u2013C","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial optimization: polyhedra and efficiency, vol A\u2013C. Springer, Berlin (2003)"},{"doi-asserted-by":"crossref","unstructured":"Strassen, V.: Numer. Math. 13:354 (1969)","key":"1092_CR8","DOI":"10.1007\/BF02165411"},{"unstructured":"Regan, K.W.: A polynomial growth puzzle (2015). G\u00f6del\u2019s Lost Letter and P = NP. https:\/\/rjlipton.wordpress.com\/2015\/09\/12\/a-polynomial-growth-puzzle\/","key":"1092_CR9"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-016-1092-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1092-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1092-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T00:51:27Z","timestamp":1749689487000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-016-1092-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,5]]},"references-count":9,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["1092"],"URL":"https:\/\/doi.org\/10.1007\/s11590-016-1092-7","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2016,11,5]]}}}