{"scopus_import":1,"article_processing_charge":"No","month":"03","date_updated":"2021-01-12T07:42:43Z","title":"A note on the complexity of real algebraic hypersurfaces","type":"journal_article","citation":{"apa":"Kerber, M., &#38; Sagraloff, M. (2011). A note on the complexity of real algebraic hypersurfaces. <i>Graphs and Combinatorics</i>. Springer. <a href=\"https://doi.org/10.1007/s00373-011-1020-7\">https://doi.org/10.1007/s00373-011-1020-7</a>","chicago":"Kerber, Michael, and Michael Sagraloff. “A Note on the Complexity of Real Algebraic Hypersurfaces.” <i>Graphs and Combinatorics</i>. Springer, 2011. <a href=\"https://doi.org/10.1007/s00373-011-1020-7\">https://doi.org/10.1007/s00373-011-1020-7</a>.","mla":"Kerber, Michael, and Michael Sagraloff. “A Note on the Complexity of Real Algebraic Hypersurfaces.” <i>Graphs and Combinatorics</i>, vol. 27, no. 3, Springer, 2011, pp. 419–30, doi:<a href=\"https://doi.org/10.1007/s00373-011-1020-7\">10.1007/s00373-011-1020-7</a>.","ieee":"M. Kerber and M. Sagraloff, “A note on the complexity of real algebraic hypersurfaces,” <i>Graphs and Combinatorics</i>, vol. 27, no. 3. Springer, pp. 419–430, 2011.","ama":"Kerber M, Sagraloff M. A note on the complexity of real algebraic hypersurfaces. <i>Graphs and Combinatorics</i>. 2011;27(3):419-430. doi:<a href=\"https://doi.org/10.1007/s00373-011-1020-7\">10.1007/s00373-011-1020-7</a>","short":"M. Kerber, M. Sagraloff, Graphs and Combinatorics 27 (2011) 419–430.","ista":"Kerber M, Sagraloff M. 2011. A note on the complexity of real algebraic hypersurfaces. Graphs and Combinatorics. 27(3), 419–430."},"date_created":"2018-12-11T12:02:43Z","has_accepted_license":"1","status":"public","article_type":"original","department":[{"_id":"HeEd"}],"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"Given an algebraic hypersurface O in ℝd, how many simplices are necessary for a simplicial complex isotopic to O? We address this problem and the variant where all vertices of the complex must lie on O. We give asymptotically tight worst-case bounds for algebraic plane curves. Our results gradually improve known bounds in higher dimensions; however, the question for tight bounds remains unsolved for d ≥ 3."}],"year":"2011","ddc":["500"],"issue":"3","publisher":"Springer","_id":"3332","volume":27,"author":[{"first_name":"Michael","orcid":"0000-0002-8030-9299","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","last_name":"Kerber","full_name":"Kerber, Michael"},{"full_name":"Sagraloff, Michael","last_name":"Sagraloff","first_name":"Michael"}],"doi":"10.1007/s00373-011-1020-7","publication_status":"published","day":"17","publication":"Graphs and Combinatorics","date_published":"2011-03-17T00:00:00Z","file":[{"relation":"main_file","access_level":"open_access","file_name":"2011_GraphsCombi_Kerber.pdf","checksum":"a63a1e3e885dcc68f1e3dea68dfbe213","file_id":"7869","date_created":"2020-05-19T16:11:36Z","content_type":"application/pdf","creator":"dernst","date_updated":"2020-07-14T12:46:08Z","file_size":143976}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"419 - 430","file_date_updated":"2020-07-14T12:46:08Z","oa":1,"language":[{"iso":"eng"}],"publist_id":"3301","quality_controlled":"1","intvolume":"        27"}