{"date_updated":"2023-01-10T13:49:25Z","type":"conference","publication":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","year":"2002","status":"public","publisher":"IEEE Comput. Soc. Press","author":[{"id":"23","last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"}],"extern":"1","title":"Computing sums of radicals in polynomial time","_id":"3041","publication_identifier":{"isbn":["0818624450"]},"department":[{"_id":"64"}],"user_id":"25078","citation":{"bibtex":"@inproceedings{Blömer_2002, title={Computing sums of radicals in polynomial time}, DOI={<a href=\"https://doi.org/10.1109/sfcs.1991.185434\">10.1109/sfcs.1991.185434</a>}, booktitle={[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science}, publisher={IEEE Comput. Soc. Press}, author={Blömer, Johannes}, year={2002} }","chicago":"Blömer, Johannes. “Computing Sums of Radicals in Polynomial Time.” In <i>[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science</i>. IEEE Comput. Soc. Press, 2002. <a href=\"https://doi.org/10.1109/sfcs.1991.185434\">https://doi.org/10.1109/sfcs.1991.185434</a>.","short":"J. Blömer, in: [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, IEEE Comput. Soc. Press, 2002.","ieee":"J. Blömer, “Computing sums of radicals in polynomial time,” 2002, doi: <a href=\"https://doi.org/10.1109/sfcs.1991.185434\">10.1109/sfcs.1991.185434</a>.","ama":"Blömer J. Computing sums of radicals in polynomial time. In: <i>[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science</i>. IEEE Comput. Soc. Press; 2002. doi:<a href=\"https://doi.org/10.1109/sfcs.1991.185434\">10.1109/sfcs.1991.185434</a>","mla":"Blömer, Johannes. “Computing Sums of Radicals in Polynomial Time.” <i>[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science</i>, IEEE Comput. Soc. Press, 2002, doi:<a href=\"https://doi.org/10.1109/sfcs.1991.185434\">10.1109/sfcs.1991.185434</a>.","apa":"Blömer, J. (2002). Computing sums of radicals in polynomial time. <i>[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science</i>. <a href=\"https://doi.org/10.1109/sfcs.1991.185434\">https://doi.org/10.1109/sfcs.1991.185434</a>"},"ddc":["000"],"publication_status":"published","doi":"10.1109/sfcs.1991.185434","file":[{"file_id":"3042","file_name":"ComputingSumsOfRadicals_01.pdf","success":1,"date_created":"2018-06-05T08:45:15Z","date_updated":"2018-06-05T08:45:15Z","creator":"feidens","file_size":335754,"access_level":"closed","content_type":"application/pdf","relation":"main_file"}],"has_accepted_license":"1","file_date_updated":"2018-06-05T08:45:15Z","date_created":"2018-06-05T08:44:18Z"}