{"publisher":"Springer","_id":"3332","file":[{"file_id":"7869","checksum":"a63a1e3e885dcc68f1e3dea68dfbe213","relation":"main_file","file_size":143976,"access_level":"open_access","content_type":"application/pdf","file_name":"2011_GraphsCombi_Kerber.pdf","date_created":"2020-05-19T16:11:36Z","creator":"dernst","date_updated":"2020-07-14T12:46:08Z"}],"intvolume":"        27","type":"journal_article","doi":"10.1007/s00373-011-1020-7","date_created":"2018-12-11T12:02:43Z","author":[{"id":"36E4574A-F248-11E8-B48F-1D18A9856A87","full_name":"Kerber, Michael","orcid":"0000-0002-8030-9299","first_name":"Michael","last_name":"Kerber"},{"full_name":"Sagraloff, Michael","first_name":"Michael","last_name":"Sagraloff"}],"has_accepted_license":"1","month":"03","day":"17","oa_version":"Submitted Version","external_id":{"isi":["000289438700011"]},"abstract":[{"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.","lang":"eng"}],"article_type":"original","publication_status":"published","publist_id":"3301","file_date_updated":"2020-07-14T12:46:08Z","volume":27,"date_published":"2011-03-17T00:00:00Z","oa":1,"year":"2011","quality_controlled":"1","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"No","date_updated":"2025-09-30T09:09:33Z","title":"A note on the complexity of real algebraic hypersurfaces","department":[{"_id":"HeEd"}],"ddc":["500"],"corr_author":"1","issue":"3","isi":1,"scopus_import":"1","citation":{"short":"M. Kerber, M. Sagraloff, Graphs and Combinatorics 27 (2011) 419–430.","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>.","ista":"Kerber M, Sagraloff M. 2011. A note on the complexity of real algebraic hypersurfaces. Graphs and Combinatorics. 27(3), 419–430.","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>","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>","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."},"page":"419 - 430","publication":"Graphs and Combinatorics","status":"public"}