%0 Conference Paper %1 conf/mfcs/HoangT01 %A Hoang, Thanh Minh %A Thierauf, Thomas %B MFCS %D 2001 %E Sgall, Jirí %E Pultr, Ales %E Kolman, Petr %I Springer %K %P 408-420 %T The Complexity of the Minimal Polynomial. %U http://dblp.uni-trier.de/db/conf/mfcs/mfcs2001.html#HoangT01 %V 2136 %@ 3-540-42496-2

@inproceedings{conf/mfcs/HoangT01, added-at = {2023-12-14T14:55:21.000+0100}, author = {Hoang, Thanh Minh and Thierauf, Thomas}, biburl = {https://www.bibsonomy.org/bibtex/287153de70ff1a3fc840f37bb07b86e30/admin}, booktitle = {MFCS}, crossref = {conf/mfcs/2001}, editor = {Sgall, Jirí and Pultr, Ales and Kolman, Petr}, ee = {https://doi.org/10.1007/3-540-44683-4_36}, interhash = {e4e4623631afd177786e4a4328ada8ec}, intrahash = {87153de70ff1a3fc840f37bb07b86e30}, isbn = {3-540-42496-2}, keywords = {}, pages = {408-420}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2023-12-14T14:55:21.000+0100}, title = {The Complexity of the Minimal Polynomial.}, url = {http://dblp.uni-trier.de/db/conf/mfcs/mfcs2001.html#HoangT01}, volume = 2136, year = 2001 }