[{"day":"17","date_updated":"2021-01-12T07:42:43Z","date_published":"2011-03-17T00:00:00Z","language":[{}],"month":"03","author":[{"first_name":"Michael","orcid":"0000-0002-8030-9299","last_name":"Kerber","id":"36E4574A-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Sagraloff","first_name":"Michael"}],"scopus_import":1,"type":"journal_article","has_accepted_license":"1","volume":27,"dc":{"type":["info:eu-repo/semantics/article","doc-type:article","text","http://purl.org/coar/resource_type/c_6501"],"source":["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"],"publisher":["Springer"],"description":["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."],"rights":["info:eu-repo/semantics/openAccess"],"language":["eng"],"creator":["Kerber, Michael","Sagraloff, Michael"],"date":["2011"],"subject":["ddc:500"],"title":["A note on the complexity of real algebraic hypersurfaces"],"identifier":["https://research-explorer.ista.ac.at/record/3332","https://research-explorer.ista.ac.at/download/3332/7869"],"relation":["info:eu-repo/semantics/altIdentifier/doi/10.1007/s00373-011-1020-7"]},"quality_controlled":"1","creator":{"id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","login":"apreinsp"},"article_processing_charge":"No","ddc":[],"_id":"3332","publication_status":"published","status":"public","department":[{"_id":"HeEd","tree":[{"_id":"ResearchGroups"},{"_id":"IST"}]}],"uri_base":"https://research-explorer.ista.ac.at","dini_type":"doc-type:article","publist_id":"3301","issue":"3","publication":"Graphs and Combinatorics","intvolume":" 27","page":"419 - 430","article_type":"original","oa":1,"file":[{"content_type":"application/pdf","date_updated":"2020-07-14T12:46:08Z","creator":"dernst","access_level":"open_access","file_name":"2011_GraphsCombi_Kerber.pdf","relation":"main_file","date_created":"2020-05-19T16:11:36Z","file_size":143976,"checksum":"a63a1e3e885dcc68f1e3dea68dfbe213","file_id":"7869"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng"}],"file_date_updated":"2020-07-14T12:46:08Z","date_created":"2018-12-11T12:02:43Z","citation":{"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.","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.","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"},"oa_version":"Submitted Version"}]