{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:14:27Z","timestamp":1725459267638},"publisher-location":"Berlin\/Heidelberg","reference-count":13,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540133720"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0030315","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T15:19:29Z","timestamp":1138202369000},"page":"339-347","source":"Crossref","is-referenced-by-count":1,"title":["Lower bounds for polygon simplicity testing and other problems"],"prefix":"10.1007","author":[{"given":"Jerzy W.","family":"Jaromczyk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","unstructured":"Avis, D., Lower bounds for geometric problems. Allerton Conference, October 1980."},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Lower bounds for algebraic computation trees, Proc. of 15-th STOC, Boston, 1983, 80\u201386.","DOI":"10.1145\/800061.808735"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Boyce, J.E., Dobkin, D.P., Drysdale, R.L., Guibas, L.J., Finding extremal polygons, Proc. of 14-th STOC, 1982, 282\u2013289.","DOI":"10.1145\/800070.802202"},{"key":"30_CR4","unstructured":"Edelsbrunner, H., Bulletin of EATCS, No.21, October 1983."},{"key":"30_CR5","unstructured":"Jaglom, I.M., Boltianski, V.G., Convex Figures, W-wa 1955 (polish)"},{"key":"30_CR6","unstructured":"Jaromczyk, J.W., A complexity bounds and euclidean space partitionig, Coll. on Alg., Comb. & Logic, Gy\u00f6r-Hungary, September 83."},{"key":"30_CR7","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1090\/S0002-9939-1964-0161339-9","volume":"15","author":"J. Milnor","year":"1964","unstructured":"Milnor, J., On the betti numbers of real algebraic varieties, Proc. AMS 15, 1964, 275\u2013280.","journal-title":"Proc. AMS"},{"issue":"6","key":"30_CR8","first-page":"498","volume":"8","author":"J. Mor\u00e1vek","year":"1972","unstructured":"Mor\u00e1vek, J., A lokalization problem in geometry and complexity of discrete programming, Kybernetika 8(6), 1972, 498\u2013516.","journal-title":"Kybernetika"},{"key":"30_CR9","unstructured":"Shamos, M.I., Computational geometry, Ph.D.Thesis, Yale Uni. 1978."},{"key":"30_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0196-6774(82)90002-5","volume":"3","author":"J.M. Steele","year":"1982","unstructured":"Steele, J.M., Yao, A.C., Lower bounds for algebraic decision trees, J. Algorithms 3, 1982, 1\u20138.","journal-title":"J. Algorithms"},{"key":"30_CR11","unstructured":"Toussaint, G.T., Pattern recognition and geometrical complexity, Conference on Pattern Recognition, 1980, 1324\u20131347."},{"key":"30_CR12","unstructured":"Toussaint, G.T., McAlear, J.A., A simple O(nlogn) algorithm for Tech.Rep.No.SOCS-82-6, March 1982, McGill Uni."},{"issue":"2","key":"30_CR13","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1137\/0209028","volume":"9","author":"A.C. Yao","year":"1980","unstructured":"Yao, A.C., Rivest, R., On the polyhedral decision problem, SIAM J. on Comput. 9(2), 1980), 343\u2013347.","journal-title":"SIAM J. on Comput."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1984"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030315.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T22:01:02Z","timestamp":1607551262000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0030315"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540133720"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0030315","relation":{},"subject":[]}}