{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T17:42:51Z","timestamp":1648834971601},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1986,3,1]],"date-time":"1986-03-01T00:00:00Z","timestamp":510019200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10000,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Complexity"],"published-print":{"date-parts":[[1986,3]]},"DOI":"10.1016\/0885-064x(86)90022-1","type":"journal-article","created":{"date-parts":[[2004,9,8]],"date-time":"2004-09-08T18:41:18Z","timestamp":1094668878000},"page":"44-59","source":"Crossref","is-referenced-by-count":11,"title":["Complexity of computing topological degree of lipschitz functions in n dimensions"],"prefix":"10.1016","volume":"2","author":[{"given":"T","family":"Boult","sequence":"first","affiliation":[]},{"given":"K","family":"Sikorski","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0885-064X(86)90022-1_BIB1","article-title":"A Program for the Numerical Approximation of a Fixed Point of an Arbitrary Continuous Mapping of the n-cube or n-cube into Itself","author":"Allgower","year":"1971"},{"key":"10.1016\/0885-064X(86)90022-1_BIB2","article-title":"Complexity of Computing Topological Degree of Lipschitz Functions in Two Dimensions","author":"Boult","year":"1985"},{"key":"10.1016\/0885-064X(86)90022-1_BIB3","series-title":"A Forum subroutine for computing topological degree of Lipschitz functions","author":"Boult","year":"1985"},{"key":"10.1016\/0885-064X(86)90022-1_BIB4","article-title":"Information Based Complexity Applied to Nonlinear Equations and Vision","author":"Boult","year":"1986","journal-title":"Ph.D. thesis"},{"key":"10.1016\/0885-064X(86)90022-1_BIB5","series-title":"Mathematical Topics in Economic Theory and Computation","first-page":"122","article-title":"A search for the fixed points of a continuous mapping","author":"Jeppson","year":"1972"},{"key":"10.1016\/0885-064X(86)90022-1_BIB6","article-title":"Computing the Degree of Maps and a Generalized Method of Bisection","author":"Kearfotr","year":"1977"},{"key":"10.1016\/0885-064X(86)90022-1_BIB7","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01404868","article-title":"An efficient degree-computation method for a generalized method of bisection","volume":"32","author":"Kearfott","year":"1979","journal-title":"Numer. Math."},{"key":"10.1016\/0885-064X(86)90022-1_BIB8","series-title":"Iterative Solution of Nonlinear Equations in Several Variables","author":"Ortega","year":"1970"},{"key":"10.1016\/0885-064X(86)90022-1_BIB9","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01459080","article-title":"Bisection is optimal","volume":"40","author":"Sikorski","year":"1982","journal-title":"Numer. Math."},{"key":"10.1016\/0885-064X(86)90022-1_BIB10","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF01419526","article-title":"Computing the topological degree of a mapping in Rn","volume":"25","author":"Stenger","year":"1975","journal-title":"Numer. Math."},{"key":"10.1016\/0885-064X(86)90022-1_BIB11","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1080\/00036817908839252","article-title":"An algorithm for numerical calculation of topological degree","volume":"9","author":"Stynes","year":"1979","journal-title":"Appl. Anal."},{"key":"10.1016\/0885-064X(86)90022-1_BIB12","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01399550","article-title":"A simplification of Stenger's topological degree formula","volume":"33","author":"Stynes","year":"1979","journal-title":"Numer. Math."},{"key":"10.1016\/0885-064X(86)90022-1_BIB13","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/BF01400322","article-title":"On the construction of sufficient refinements for computation of topological degree","volume":"37","author":"Stynes","year":"1981","journal-title":"Numer. Math."},{"key":"10.1016\/0885-064X(86)90022-1_BIB14","series-title":"A General Theory of Optimal Algorithms","author":"Traub","year":"1980"},{"key":"10.1016\/0885-064X(86)90022-1_BIB15","first-page":"35","article-title":"Information and computation","volume":"Vol. 23","author":"Traub","year":"1984"}],"container-title":["Journal of Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X86900221?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X86900221?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T01:58:57Z","timestamp":1549245537000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0885064X86900221"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,3]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1986,3]]}},"alternative-id":["0885064X86900221"],"URL":"https:\/\/doi.org\/10.1016\/0885-064x(86)90022-1","relation":{},"ISSN":["0885-064X"],"issn-type":[{"value":"0885-064X","type":"print"}],"subject":[],"published":{"date-parts":[[1986,3]]}}}