Computing sums of radicals in polynomial time
J. Blömer, in: Proceedings 32nd Annual Symposium of Foundations of Computer Science, IEEE Comput. Soc. Press, 1991.
Download
No fulltext has been uploaded.
Conference Paper
| Published
Author
Department
Publishing Year
Proceedings Title
Proceedings 32nd Annual Symposium of Foundations of Computer Science
ISBN
LibreCat-ID
Cite this
Blömer J. Computing sums of radicals in polynomial time. In: Proceedings 32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc. Press; 1991. doi:10.1109/sfcs.1991.185434
Blömer, J. (1991). Computing sums of radicals in polynomial time. In Proceedings 32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc. Press. https://doi.org/10.1109/sfcs.1991.185434
@inproceedings{Blömer_1991, title={Computing sums of radicals in polynomial time}, DOI={10.1109/sfcs.1991.185434}, booktitle={Proceedings 32nd Annual Symposium of Foundations of Computer Science}, publisher={IEEE Comput. Soc. Press}, author={Blömer, Johannes}, year={1991} }
Blömer, Johannes. “Computing Sums of Radicals in Polynomial Time.” In Proceedings 32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc. Press, 1991. https://doi.org/10.1109/sfcs.1991.185434.
J. Blömer, “Computing sums of radicals in polynomial time,” in Proceedings 32nd Annual Symposium of Foundations of Computer Science, 1991.
Blömer, Johannes. “Computing Sums of Radicals in Polynomial Time.” Proceedings 32nd Annual Symposium of Foundations of Computer Science, IEEE Comput. Soc. Press, 1991, doi:10.1109/sfcs.1991.185434.
Google Scholar
ISBN Search