default search action
Search dblp for Publications
export results for "Finding roots of polynomials over finite fields."
@inproceedings{DBLP:conf/wcsp/LiYSH23, author = {Pingping Li and Leilei Yu and Linqi Song and Hanxu Hou}, title = {A Fast Algorithm for Finding the Roots of Polynomials over Finite Fields}, booktitle = {International Conference on Wireless Communications and Signal Processing, {WCSP} 2023, Hangzhou, China, November 2-4, 2023}, pages = {299--304}, publisher = {{IEEE}}, year = {2023}, url = {https://doi.org/10.1109/WCSP58612.2023.10404656}, doi = {10.1109/WCSP58612.2023.10404656}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wcsp/LiYSH23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-cs-0606035, author = {Sergei V. Fedorenko and Peter Vladimirovich Trifonov}, title = {Finding roots of polynomials over finite fields}, journal = {CoRR}, volume = {abs/cs/0606035}, year = {2006}, url = {http://arxiv.org/abs/cs/0606035}, eprinttype = {arXiv}, eprint = {cs/0606035}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-cs-0606035.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcom/FedorenkoT02, author = {Sergei V. Fedorenko and Peter Trifonov}, title = {Finding roots of polynomials over finite fields}, journal = {{IEEE} Trans. Commun.}, volume = {50}, number = {11}, pages = {1709--1711}, year = {2002}, url = {https://doi.org/10.1109/TCOMM.2002.805269}, doi = {10.1109/TCOMM.2002.805269}, timestamp = {Tue, 01 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcom/FedorenkoT02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.