{"type":"journal_article","publication":"Graphs and Combinatorics","date_published":"2011-03-17T00:00:00Z","citation":{"apa":"Kerber, M., & Sagraloff, M. (2011). A note on the complexity of real algebraic hypersurfaces. Graphs and Combinatorics. Springer. https://doi.org/10.1007/s00373-011-1020-7","chicago":"Kerber, Michael, and Michael Sagraloff. “A Note on the Complexity of Real Algebraic Hypersurfaces.” Graphs and Combinatorics. Springer, 2011. https://doi.org/10.1007/s00373-011-1020-7.","ieee":"M. Kerber and M. Sagraloff, “A note on the complexity of real algebraic hypersurfaces,” Graphs and Combinatorics, vol. 27, no. 3. Springer, pp. 419–430, 2011.","mla":"Kerber, Michael, and Michael Sagraloff. “A Note on the Complexity of Real Algebraic Hypersurfaces.” Graphs and Combinatorics, vol. 27, no. 3, Springer, 2011, pp. 419–30, doi:10.1007/s00373-011-1020-7.","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.","ama":"Kerber M, Sagraloff M. A note on the complexity of real algebraic hypersurfaces. Graphs and Combinatorics. 2011;27(3):419-430. doi:10.1007/s00373-011-1020-7"},"volume":27,"ddc":["500"],"year":"2011","scopus_import":1,"issue":"3","status":"public","oa_version":"Submitted Version","title":"A note on the complexity of real algebraic hypersurfaces","doi":"10.1007/s00373-011-1020-7","article_type":"original","article_processing_charge":"No","department":[{"_id":"HeEd"}],"publisher":"Springer","intvolume":" 27","author":[{"first_name":"Michael","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","full_name":"Kerber, Michael","orcid":"0000-0002-8030-9299","last_name":"Kerber"},{"first_name":"Michael","full_name":"Sagraloff, Michael","last_name":"Sagraloff"}],"date_created":"2018-12-11T12:02:43Z","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."}],"oa":1,"publist_id":"3301","has_accepted_license":"1","publication_status":"published","date_updated":"2021-01-12T07:42:43Z","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:08Z","file":[{"relation":"main_file","file_id":"7869","checksum":"a63a1e3e885dcc68f1e3dea68dfbe213","date_created":"2020-05-19T16:11:36Z","date_updated":"2020-07-14T12:46:08Z","access_level":"open_access","file_size":143976,"file_name":"2011_GraphsCombi_Kerber.pdf","content_type":"application/pdf","creator":"dernst"}],"month":"03","day":"17","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"3332","page":"419 - 430"}