default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "Testing Polynomials."
download as .bib file
@article{DBLP:journals/axioms/Pycke24,
author = {Jean{-}Renaud Pycke},
title = {A Discrete Cram{\'{e}}r-Von Mises Statistic Related to Hahn Polynomials
with Application to Goodness-of-Fit Testing for Hypergeometric Distributions},
journal = {Axioms},
volume = {13},
number = {6},
pages = {369},
year = {2024},
url = {https://doi.org/10.3390/axioms13060369},
doi = {10.3390/AXIOMS13060369},
timestamp = {Fri, 26 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/axioms/Pycke24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ffa/AichingerGH24,
author = {Erhard Aichinger and
Simon Gr{\"{u}}nbacher and
Paul Hametner},
title = {Zero testing and equation solving for sparse polynomials on rectangular
domains},
journal = {Finite Fields Their Appl.},
volume = {95},
pages = {102379},
year = {2024},
url = {https://doi.org/10.1016/j.ffa.2024.102379},
doi = {10.1016/J.FFA.2024.102379},
timestamp = {Sun, 06 Oct 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ffa/AichingerGH24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BaraskarD0S24,
author = {Omkar Baraskar and
Agrim Dewan and
Chandan Saha and
Pulkit Sinha},
editor = {Karl Bringmann and
Martin Grohe and
Gabriele Puppis and
Ola Svensson},
title = {NP-Hardness of Testing Equivalence to Sparse Polynomials and to Constant-Support
Polynomials},
booktitle = {51st International Colloquium on Automata, Languages, and Programming,
{ICALP} 2024, July 8-12, 2024, Tallinn, Estonia},
series = {LIPIcs},
volume = {297},
pages = {16:1--16:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2024.16},
doi = {10.4230/LIPICS.ICALP.2024.16},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BaraskarD0S24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/issac/NahshonS24,
author = {Ido Nahshon and
Amir Shpilka},
editor = {Jonathan D. Hauenstein and
Wen{-}shin Lee and
Shaoshi Chen},
title = {New Bounds on Quotient Polynomials with Applications to Exact Division
and Divisibility Testing of Sparse Polynomials},
booktitle = {Proceedings of the 2024 International Symposium on Symbolic and Algebraic
Computation, {ISSAC} 2024, Raleigh, NC, USA, July 16-19, 2024},
pages = {91--99},
publisher = {{ACM}},
year = {2024},
url = {https://doi.org/10.1145/3666000.3669679},
doi = {10.1145/3666000.3669679},
timestamp = {Fri, 19 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/issac/NahshonS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BaraskarD024,
author = {Omkar Baraskar and
Agrim Dewan and
Chandan Saha},
editor = {Olaf Beyersdorff and
Mamadou Moustapha Kant{\'{e}} and
Orna Kupferman and
Daniel Lokshtanov},
title = {Testing Equivalence to Design Polynomials},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2024, March 12-14, 2024, Clermont-Ferrand, France},
series = {LIPIcs},
volume = {289},
pages = {9:1--9:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.STACS.2024.9},
doi = {10.4230/LIPICS.STACS.2024.9},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BaraskarD024.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BaraskarD024,
author = {Omkar Baraskar and
Agrim Dewan and
Chandan Saha},
title = {Testing equivalence to design polynomials},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR24-004}},
year = {2024},
url = {https://eccc.weizmann.ac.il/report/2024/004},
eprinttype = {ECCC},
eprint = {TR24-004},
timestamp = {Thu, 08 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BaraskarD024.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BaraskarD0S24,
author = {Omkar Baraskar and
Agrim Dewan and
Chandan Saha and
Pulkit Sinha},
title = {NP-hardness of testing equivalence to sparse polynomials and to constant-support
polynomials},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR24-104}},
year = {2024},
url = {https://eccc.weizmann.ac.il/report/2024/104},
eprinttype = {ECCC},
eprint = {TR24-104},
timestamp = {Thu, 08 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BaraskarD0S24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/hal/Cray23,
author = {Armelle Perret du Cray},
title = {Algorithmes pour les polyn{\^{o}}mes creux: interpolation, arithm{\'{e}}tique,
test d'identit{\'{e}}. (Algorithms for Sparse Polynomials: interpolation,
arithmetic, identity testing)},
school = {University of Montpellier, France},
year = {2023},
url = {https://tel.archives-ouvertes.fr/tel-04323357},
timestamp = {Thu, 04 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/phd/hal/Cray23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sac/LyuB23,
author = {Guanjie Lyu and
Mohamed Belalia},
title = {Testing symmetry for bivariate copulas using Bernstein polynomials},
journal = {Stat. Comput.},
volume = {33},
number = {6},
pages = {128},
year = {2023},
url = {https://doi.org/10.1007/s11222-023-10297-1},
doi = {10.1007/S11222-023-10297-1},
timestamp = {Fri, 06 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sac/LyuB23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/SheY23,
author = {Adrian She and
Henry Yuen},
editor = {Yael Tauman Kalai},
title = {Unitary Property Testing Lower Bounds by Polynomials},
booktitle = {14th Innovations in Theoretical Computer Science Conference, {ITCS}
2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, {USA}},
series = {LIPIcs},
volume = {251},
pages = {96:1--96:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2023.96},
doi = {10.4230/LIPICS.ITCS.2023.96},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/SheY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ChillaraGS23,
author = {Suryajith Chillara and
Coral Grichener and
Amir Shpilka},
editor = {Petra Berenbrink and
Patricia Bouyer and
Anuj Dawar and
Mamadou Moustapha Kant{\'{e}}},
title = {On Hardness of Testing Equivalence to Sparse Polynomials Under Shifts},
booktitle = {40th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2023, March 7-9, 2023, Hamburg, Germany},
series = {LIPIcs},
volume = {254},
pages = {22:1--22:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.STACS.2023.22},
doi = {10.4230/LIPICS.STACS.2023.22},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ChillaraGS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-03885,
author = {Ido Nahshon and
Amir Shpilka},
title = {New Bounds on Quotient Polynomials with Applications to Exact Divisibility
and Divisibility Testing of Sparse Polynomials},
journal = {CoRR},
volume = {abs/2308.03885},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.03885},
doi = {10.48550/ARXIV.2308.03885},
eprinttype = {arXiv},
eprint = {2308.03885},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-03885.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/AronovES22,
author = {Boris Aronov and
Esther Ezra and
Micha Sharir},
title = {Testing Polynomials for Vanishing on Cartesian Products of Planar
Point Sets: Collinearity Testing and Related Problems},
journal = {Discret. Comput. Geom.},
volume = {68},
number = {4},
pages = {997--1048},
year = {2022},
url = {https://doi.org/10.1007/s00454-022-00437-1},
doi = {10.1007/S00454-022-00437-1},
timestamp = {Sun, 25 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/AronovES22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/RaoS22,
author = {B. V. Raghavendra Rao and
Jayalal Sarma},
title = {Isomorphism testing of read-once functions and polynomials},
journal = {Inf. Comput.},
volume = {285},
number = {Part},
pages = {104921},
year = {2022},
url = {https://doi.org/10.1016/j.ic.2022.104921},
doi = {10.1016/J.IC.2022.104921},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/RaoS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jfi/GhorbaniRTP22,
author = {Majid Ghorbani and
Hossein Rezaei and
Aleksei Tepljakov and
Eduard Petlenkov},
title = {Robust stability testing function for a complex interval family of
fractional-order polynomials},
journal = {J. Frankl. Inst.},
volume = {359},
number = {17},
pages = {10038--10057},
year = {2022},
url = {https://doi.org/10.1016/j.jfranklin.2022.09.042},
doi = {10.1016/J.JFRANKLIN.2022.09.042},
timestamp = {Mon, 05 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jfi/GhorbaniRTP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/Bshouty22,
author = {Nader H. Bshouty},
editor = {Armando Casta{\~{n}}eda and
Francisco Rodr{\'{\i}}guez{-}Henr{\'{\i}}quez},
title = {Almost Optimal Proper Learning and Testing Polynomials},
booktitle = {{LATIN} 2022: Theoretical Informatics - 15th Latin American Symposium,
Guanajuato, Mexico, November 7-11, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13568},
pages = {312--327},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-20624-5\_19},
doi = {10.1007/978-3-031-20624-5\_19},
timestamp = {Thu, 03 Nov 2022 11:43:27 +0100},
biburl = {https://dblp.org/rec/conf/latin/Bshouty22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-03207,
author = {Nader H. Bshouty},
title = {Almost Optimal Proper Learning and Testing Polynomials},
journal = {CoRR},
volume = {abs/2202.03207},
year = {2022},
url = {https://arxiv.org/abs/2202.03207},
eprinttype = {arXiv},
eprint = {2202.03207},
timestamp = {Wed, 09 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-03207.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-06968,
author = {Shaoshi Chen and
Lixin Du and
Hanqian Fang},
title = {Shift Equivalence Testing of Polynomials and Symbolic Summation of
Multivariate Rational Functions},
journal = {CoRR},
volume = {abs/2204.06968},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.06968},
doi = {10.48550/ARXIV.2204.06968},
eprinttype = {arXiv},
eprint = {2204.06968},
timestamp = {Tue, 19 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-06968.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-10588,
author = {Suryajith Chillara and
Coral Grichener and
Amir Shpilka},
title = {On Hardness of Testing Equivalence to Sparse Polynomials Under Shifts},
journal = {CoRR},
volume = {abs/2207.10588},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.10588},
doi = {10.48550/ARXIV.2207.10588},
eprinttype = {arXiv},
eprint = {2207.10588},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-10588.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-05885,
author = {Adrian She and
Henry Yuen},
title = {Unitary property testing lower bounds by polynomials},
journal = {CoRR},
volume = {abs/2210.05885},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.05885},
doi = {10.48550/ARXIV.2210.05885},
eprinttype = {arXiv},
eprint = {2210.05885},
timestamp = {Wed, 19 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-05885.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChillaraGS22,
author = {Suryajith Chillara and
Coral Grichener and
Amir Shpilka},
title = {On Hardness of Testing Equivalence to Sparse Polynomials Under Shifts},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR22-106}},
year = {2022},
url = {https://eccc.weizmann.ac.il/report/2022/106},
eprinttype = {ECCC},
eprint = {TR22-106},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChillaraGS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/Kunisky21,
author = {Dmitriy Kunisky},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Hypothesis testing with low-degree polynomials in the Morris class
of exponential families},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {2822--2848},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/kunisky21a.html},
timestamp = {Wed, 25 Aug 2021 17:11:16 +0200},
biburl = {https://dblp.org/rec/conf/colt/Kunisky21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/issac/GiorgiGC21,
author = {Pascal Giorgi and
Bruno Grenet and
Armelle Perret du Cray},
editor = {Fr{\'{e}}d{\'{e}}ric Chyzak and
George Labahn},
title = {On Exact Division and Divisibility Testing for Sparse Polynomials},
booktitle = {{ISSAC} '21: International Symposium on Symbolic and Algebraic Computation,
Virtual Event, Russia, July 18-23, 2021},
pages = {163--170},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3452143.3465539},
doi = {10.1145/3452143.3465539},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/issac/GiorgiGC21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GrochowQT21,
author = {Joshua A. Grochow and
Youming Qiao and
Gang Tang},
editor = {Markus Bl{\"{a}}ser and
Benjamin Monmege},
title = {Average-Case Algorithms for Testing Isomorphism of Polynomials, Algebras,
and Multilinear Forms},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2021, March 16-19, 2021, Saarbr{\"{u}}cken, Germany (Virtual
Conference)},
series = {LIPIcs},
volume = {187},
pages = {38:1--38:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.STACS.2021.38},
doi = {10.4230/LIPICS.STACS.2021.38},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/GrochowQT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PelegS21,
author = {Shir Peleg and
Amir Shpilka},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Polynomial time deterministic identity testing algorithm for {\(\Sigma\)}\({}^{\mbox{[3]}}\){\(\Pi\)}{\(\Sigma\)}{\(\Pi\)}\({}^{\mbox{[2]}}\)
circuits via Edelstein-Kelly type theorem for quadratic polynomials},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {259--271},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451013},
doi = {10.1145/3406325.3451013},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/PelegS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-04826,
author = {Pascal Giorgi and
Bruno Grenet and
Armelle Perret du Cray},
title = {On exact division and divisibility testing for sparse polynomials},
journal = {CoRR},
volume = {abs/2102.04826},
year = {2021},
url = {https://arxiv.org/abs/2102.04826},
eprinttype = {arXiv},
eprint = {2102.04826},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-04826.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mics/DeyP20,
author = {Papri Dey and
Daniel Plaumann},
title = {Testing Hyperbolicity of Real Polynomials},
journal = {Math. Comput. Sci.},
volume = {14},
number = {1},
pages = {111--121},
year = {2020},
url = {https://doi.org/10.1007/s11786-019-00449-w},
doi = {10.1007/S11786-019-00449-W},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mics/DeyP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Bafna0S20,
author = {Mitali Bafna and
Srikanth Srinivasan and
Madhu Sudan},
title = {Local decoding and testing of polynomials over grids},
journal = {Random Struct. Algorithms},
volume = {57},
number = {3},
pages = {658--694},
year = {2020},
url = {https://doi.org/10.1002/rsa.20933},
doi = {10.1002/RSA.20933},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Bafna0S20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BlaserP20,
author = {Markus Bl{\"{a}}ser and
Anurag Pandey},
editor = {Jaroslaw Byrka and
Raghu Meka},
title = {Polynomial Identity Testing for Low Degree Polynomials with Optimal
Randomness},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2020, August 17-19, 2020, Virtual
Conference},
series = {LIPIcs},
volume = {176},
pages = {8:1--8:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.8},
doi = {10.4230/LIPICS.APPROX/RANDOM.2020.8},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/BlaserP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AronovES20,
author = {Boris Aronov and
Esther Ezra and
Micha Sharir},
editor = {Sergio Cabello and
Danny Z. Chen},
title = {Testing Polynomials for Vanishing on Cartesian Products of Planar
Point Sets},
booktitle = {36th International Symposium on Computational Geometry, SoCG 2020,
June 23-26, 2020, Z{\"{u}}rich, Switzerland},
series = {LIPIcs},
volume = {164},
pages = {8:1--8:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2020.8},
doi = {10.4230/LIPICS.SOCG.2020.8},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/AronovES20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iscas/Bistritz20,
author = {Yuval Bistritz},
title = {Testing Stability of Bivariate Continuous-Time System Polynomials},
booktitle = {{IEEE} International Symposium on Circuits and Systems, {ISCAS} 2020,
Sevilla, Spain, October 10-21, 2020},
pages = {1--5},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/ISCAS45731.2020.9181061},
doi = {10.1109/ISCAS45731.2020.9181061},
timestamp = {Mon, 18 Jan 2021 08:38:59 +0100},
biburl = {https://dblp.org/rec/conf/iscas/Bistritz20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iscas/KrausA20,
author = {Frantisek J. Kraus and
Panajotis Agathoklis},
title = {Stability Testing of 2D Filters Based on Tschebyscheff Polynomials
and Generalized Eigenvalues},
booktitle = {{IEEE} International Symposium on Circuits and Systems, {ISCAS} 2020,
Sevilla, Spain, October 10-21, 2020},
pages = {1--5},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/ISCAS45731.2020.9181050},
doi = {10.1109/ISCAS45731.2020.9181050},
timestamp = {Mon, 18 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iscas/KrausA20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-09533,
author = {Boris Aronov and
Esther Ezra and
Micha Sharir},
title = {Testing Polynomials for Vanishing on Cartesian Products of Planar
Point Sets},
journal = {CoRR},
volume = {abs/2003.09533},
year = {2020},
url = {https://arxiv.org/abs/2003.09533},
eprinttype = {arXiv},
eprint = {2003.09533},
timestamp = {Tue, 24 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2003-09533.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-08263,
author = {Shir Peleg and
Amir Shpilka},
title = {Polynomial time deterministic identity testingalgorithm for {\(\Sigma\)}\({}^{\mbox{[3]}}\){\(\Pi\)}{\(\Sigma\)}{\(\Pi\)}\({}^{\mbox{[2]}}\)
circuits via Edelstein-Kelly type theorem for quadratic polynomials},
journal = {CoRR},
volume = {abs/2006.08263},
year = {2020},
url = {https://arxiv.org/abs/2006.08263},
eprinttype = {arXiv},
eprint = {2006.08263},
timestamp = {Wed, 17 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-08263.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-03693,
author = {Dmitriy Kunisky},
title = {Hypothesis testing with low-degree polynomials in the Morris class
of exponential families},
journal = {CoRR},
volume = {abs/2011.03693},
year = {2020},
url = {https://arxiv.org/abs/2011.03693},
eprinttype = {arXiv},
eprint = {2011.03693},
timestamp = {Thu, 12 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-03693.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-01085,
author = {Joshua A. Grochow and
Youming Qiao and
Gang Tang},
title = {Average-case algorithms for testing isomorphism of polynomials, algebras,
and multilinear forms},
journal = {CoRR},
volume = {abs/2012.01085},
year = {2020},
url = {https://arxiv.org/abs/2012.01085},
eprinttype = {arXiv},
eprint = {2012.01085},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2012-01085.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/IvanyosQ19,
author = {G{\'{a}}bor Ivanyos and
Youming Qiao},
title = {Algorithms Based on *-Algebras, and Their Applications to Isomorphism
of Polynomials with One Secret, Group Isomorphism, and Polynomial
Identity Testing},
journal = {{SIAM} J. Comput.},
volume = {48},
number = {3},
pages = {926--963},
year = {2019},
url = {https://doi.org/10.1137/18M1165682},
doi = {10.1137/18M1165682},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/IvanyosQ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/KarpinskiMS18,
author = {Marek Karpinski and
L{\'{a}}szl{\'{o}} M{\'{e}}rai and
Igor E. Shparlinski},
title = {Identity testing and interpolation from high powers of polynomials
of large degree over finite fields},
journal = {J. Complex.},
volume = {49},
pages = {74--84},
year = {2018},
url = {https://doi.org/10.1016/j.jco.2018.07.006},
doi = {10.1016/J.JCO.2018.07.006},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/KarpinskiMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/0001S18,
author = {Srikanth Srinivasan and
Madhu Sudan},
editor = {Anna R. Karlin},
title = {Local Decoding and Testing of Polynomials over Grids},
booktitle = {9th Innovations in Theoretical Computer Science Conference, {ITCS}
2018, January 11-14, 2018, Cambridge, MA, {USA}},
series = {LIPIcs},
volume = {94},
pages = {26:1--26:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2018.26},
doi = {10.4230/LIPICS.ITCS.2018.26},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/0001S18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/IvanyosQ18,
author = {G{\'{a}}bor Ivanyos and
Youming Qiao},
editor = {Artur Czumaj},
title = {Algorithms based on *-algebras, and their applications to isomorphism
of polynomials with one secret, group isomorphism, and polynomial
identity testing},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {2357--2376},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.152},
doi = {10.1137/1.9781611975031.152},
timestamp = {Tue, 02 Feb 2021 17:07:58 +0100},
biburl = {https://dblp.org/rec/conf/soda/IvanyosQ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cssc/LedwinaW17,
author = {Teresa Ledwina and
Grzegorz Wylupek},
title = {On Charlier polynomials in testing Poissonity},
journal = {Commun. Stat. Simul. Comput.},
volume = {46},
number = {3},
pages = {1918--1932},
year = {2017},
url = {https://doi.org/10.1080/03610918.2015.1019000},
doi = {10.1080/03610918.2015.1019000},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cssc/LedwinaW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcphy/OhnoTS17,
author = {Munekazu Ohno and
Tomohiro Takaki and
Yasushi Shibuta},
title = {Numerical testing of quantitative phase-field models with different
polynomials for isothermal solidification in binary alloys},
journal = {J. Comput. Phys.},
volume = {335},
pages = {621--636},
year = {2017},
url = {https://doi.org/10.1016/j.jcp.2017.01.053},
doi = {10.1016/J.JCP.2017.01.053},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcphy/OhnoTS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-03495,
author = {G{\'{a}}bor Ivanyos and
Youming Qiao},
title = {Algorithms based on *-algebras, and their applications to isomorphism
of polynomials with one secret, group isomorphism, and polynomial
identity testing},
journal = {CoRR},
volume = {abs/1708.03495},
year = {2017},
url = {http://arxiv.org/abs/1708.03495},
eprinttype = {arXiv},
eprint = {1708.03495},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-03495.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-09095,
author = {Marek Karpinski and
Igor E. Shparlinski},
title = {Identity Testing from High Powers of Polynomials of Large Degree over
Finite Fields},
journal = {CoRR},
volume = {abs/1708.09095},
year = {2017},
url = {http://arxiv.org/abs/1708.09095},
eprinttype = {arXiv},
eprint = {1708.09095},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-09095.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-06036,
author = {Srikanth Srinivasan and
Madhu Sudan},
title = {Local decoding and testing of polynomials over grids},
journal = {CoRR},
volume = {abs/1709.06036},
year = {2017},
url = {http://arxiv.org/abs/1709.06036},
eprinttype = {arXiv},
eprint = {1709.06036},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-06036.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/SrinivasanS17,
author = {Srikanth Srinivasan and
Madhu Sudan},
title = {Local decoding and testing of polynomials over grids},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-138}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/138},
eprinttype = {ECCC},
eprint = {TR17-138},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/SrinivasanS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MahajanRS16,
author = {Meena Mahajan and
B. V. Raghavendra Rao and
Karteek Sreenivasaiah},
title = {Building Above Read-Once Polynomials: Identity Testing and Hardness
of Representation},
journal = {Algorithmica},
volume = {76},
number = {4},
pages = {890--909},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0101-z},
doi = {10.1007/S00453-015-0101-Z},
timestamp = {Sun, 06 Oct 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MahajanRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/0001S16a,
author = {Mrinal Kumar and
Shubhangi Saraf},
editor = {Ran Raz},
title = {Sums of Products of Polynomials in Few Variables: Lower Bounds and
Polynomial Identity Testing},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {35:1--35:29},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.35},
doi = {10.4230/LIPICS.CCC.2016.35},
timestamp = {Thu, 02 Feb 2023 13:27:05 +0100},
biburl = {https://dblp.org/rec/conf/coco/0001S16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/EngelsRS16,
author = {Christian Engels and
B. V. Raghavendra Rao and
Karteek Sreenivasaiah},
title = {Lower Bounds and Identity Testing for Projections of Power Symmetric
Polynomials},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-153}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/153},
eprinttype = {ECCC},
eprint = {TR16-153},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/EngelsRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/em/DubickasS15,
author = {Arturas Dubickas and
Min Sha},
title = {Counting and Testing Dominant Polynomials},
journal = {Exp. Math.},
volume = {24},
number = {3},
pages = {312--325},
year = {2015},
url = {https://doi.org/10.1080/10586458.2014.992080},
doi = {10.1080/10586458.2014.992080},
timestamp = {Thu, 09 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/em/DubickasS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/0001S15a,
author = {Mrinal Kumar and
Shubhangi Saraf},
title = {Sums of products of polynomials in few variables : lower bounds and
polynomial identity testing},
journal = {CoRR},
volume = {abs/1504.06213},
year = {2015},
url = {http://arxiv.org/abs/1504.06213},
eprinttype = {arXiv},
eprint = {1504.06213},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/0001S15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/0001S15,
author = {Mrinal Kumar and
Shubhangi Saraf},
title = {Sums of products of polynomials in few variables : lower bounds and
polynomial identity testing},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-071}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/071},
eprinttype = {ECCC},
eprint = {TR15-071},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/0001S15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/MahajanRS15,
author = {Meena Mahajan and
B. V. Raghavendra Rao and
Karteek Sreenivasaiah},
title = {Building above read-once polynomials: identity testing and hardness
of representation},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-202}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/202},
eprinttype = {ECCC},
eprint = {TR15-202},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/MahajanRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amco/BiasseJ14,
author = {Jean{-}Fran{\c{c}}ois Biasse and
Michael J. Jacobson Jr.},
title = {Smoothness testing of polynomials over finite fields},
journal = {Adv. Math. Commun.},
volume = {8},
number = {4},
pages = {459--477},
year = {2014},
url = {https://doi.org/10.3934/amc.2014.8.459},
doi = {10.3934/AMC.2014.8.459},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/amco/BiasseJ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmaa/ChenCY14,
author = {Shenshi Chen and
Yaqing Chen and
Quanhai Yang},
title = {Toward Randomized Testing of Q-Monomials in multivariate polynomials},
journal = {Discret. Math. Algorithms Appl.},
volume = {6},
number = {2},
year = {2014},
url = {https://doi.org/10.1142/S1793830914500165},
doi = {10.1142/S1793830914500165},
timestamp = {Wed, 12 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmaa/ChenCY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/MahajanRS14,
author = {Meena Mahajan and
B. V. Raghavendra Rao and
Karteek Sreenivasaiah},
editor = {Zhipeng Cai and
Alex Zelikovsky and
Anu G. Bourgeois},
title = {Building above Read-once Polynomials: Identity Testing and Hardness
of Representation},
booktitle = {Computing and Combinatorics - 20th International Conference, {COCOON}
2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8591},
pages = {1--12},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08783-2\_1},
doi = {10.1007/978-3-319-08783-2\_1},
timestamp = {Sun, 06 Oct 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/MahajanRS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/BaartseM14,
author = {Martijn Baartse and
Klaus Meer},
editor = {Edward A. Hirsch and
Sergei O. Kuznetsov and
Jean{-}{\'{E}}ric Pin and
Nikolay K. Vereshchagin},
title = {Testing Low Degree Trigonometric Polynomials},
booktitle = {Computer Science - Theory and Applications - 9th International Computer
Science Symposium in Russia, {CSR} 2014, Moscow, Russia, June 7-11,
2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8476},
pages = {77--96},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-06686-8\_7},
doi = {10.1007/978-3-319-06686-8\_7},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/csr/BaartseM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DvirOS14,
author = {Zeev Dvir and
Rafael Oliveira and
Amir Shpilka},
editor = {Javier Esparza and
Pierre Fraigniaud and
Thore Husfeldt and
Elias Koutsoupias},
title = {Testing Equivalence of Polynomials under Shifts},
booktitle = {Automata, Languages, and Programming - 41st International Colloquium,
{ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {8572},
pages = {417--428},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-43948-7\_35},
doi = {10.1007/978-3-662-43948-7\_35},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/DvirOS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DvirOS14,
author = {Zeev Dvir and
Rafael Oliveira and
Amir Shpilka},
title = {Testing Equivalence of Polynomials under Shifts},
journal = {CoRR},
volume = {abs/1401.3714},
year = {2014},
url = {http://arxiv.org/abs/1401.3714},
eprinttype = {arXiv},
eprint = {1401.3714},
timestamp = {Tue, 07 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/DvirOS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DvirOS14,
author = {Zeev Dvir and
Rafael Oliveira and
Amir Shpilka},
title = {Testing Equivalence of Polynomials under Shifts},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-003}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/003},
eprinttype = {ECCC},
eprint = {TR14-003},
timestamp = {Tue, 07 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/DvirOS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsc/Michalska13,
author = {Maria Michalska},
title = {Curves testing boundedness of polynomials on subsets of the real plane},
journal = {J. Symb. Comput.},
volume = {56},
pages = {107--124},
year = {2013},
url = {https://doi.org/10.1016/j.jsc.2013.04.001},
doi = {10.1016/J.JSC.2013.04.001},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsc/Michalska13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HaramatySS13,
author = {Elad Haramaty and
Amir Shpilka and
Madhu Sudan},
title = {Optimal Testing of Multivariate Polynomials over Small Prime Fields},
journal = {{SIAM} J. Comput.},
volume = {42},
number = {2},
pages = {536--562},
year = {2013},
url = {https://doi.org/10.1137/120879257},
doi = {10.1137/120879257},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HaramatySS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChenFLS13,
author = {Zhixiang Chen and
Bin Fu and
Yang Liu and
Robert T. Schweller},
title = {On testing monomials in multivariate polynomials},
journal = {Theor. Comput. Sci.},
volume = {497},
pages = {39--54},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2012.03.038},
doi = {10.1016/J.TCS.2012.03.038},
timestamp = {Wed, 04 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ChenFLS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/crc/13/Giesbrecht13,
author = {Mark Giesbrecht},
editor = {Gary L. Mullen and
Daniel Panario},
title = {Algorithms for irreducibility testing and for constructing irreducible
polynomials},
booktitle = {Handbook of Finite Fields},
series = {Discrete mathematics and its applications},
pages = {374--379},
publisher = {{CRC} Press},
year = {2013},
timestamp = {Mon, 08 Jun 2020 15:38:06 +0200},
biburl = {https://dblp.org/rec/books/crc/13/Giesbrecht13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1302-5898,
author = {Shenshi Chen and
Yaqing Chen and
Quanhai Yang},
title = {Towards Randomized Testing of {\textdollar}q{\textdollar}-Monomials
in Multivariate Polynomials},
journal = {CoRR},
volume = {abs/1302.5898},
year = {2013},
url = {http://arxiv.org/abs/1302.5898},
eprinttype = {arXiv},
eprint = {1302.5898},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1302-5898.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aaecc/CipuDM11,
author = {Mihai Cipu and
Isma{\"{\i}}la Diouf and
Maurice Mignotte},
title = {Testing degenerate polynomials},
journal = {Appl. Algebra Eng. Commun. Comput.},
volume = {22},
number = {4},
pages = {289--300},
year = {2011},
url = {https://doi.org/10.1007/s00200-011-0150-8},
doi = {10.1007/S00200-011-0150-8},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aaecc/CipuDM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DiakonikolasLMSW11,
author = {Ilias Diakonikolas and
Homin K. Lee and
Kevin Matulef and
Rocco A. Servedio and
Andrew Wan},
title = {Efficiently Testing Sparse \emph{GF}(2) Polynomials},
journal = {Algorithmica},
volume = {61},
number = {3},
pages = {580--605},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9426-9},
doi = {10.1007/S00453-010-9426-9},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DiakonikolasLMSW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/ChenF11,
author = {Zhixiang Chen and
Bin Fu},
editor = {Weifan Wang and
Xuding Zhu and
Ding{-}Zhu Du},
title = {The Complexity of Testing Monomials in Multivariate Polynomials},
booktitle = {Combinatorial Optimization and Applications - 5th International Conference,
{COCOA} 2011, Zhangjiajie, China, August 4-6, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6831},
pages = {1--15},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22616-8\_1},
doi = {10.1007/978-3-642-22616-8\_1},
timestamp = {Wed, 04 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/ChenF11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/ChenFLS11,
author = {Zhixiang Chen and
Bin Fu and
Yang Liu and
Robert T. Schweller},
editor = {Weifan Wang and
Xuding Zhu and
Ding{-}Zhu Du},
title = {Algorithms for Testing Monomials in Multivariate Polynomials},
booktitle = {Combinatorial Optimization and Applications - 5th International Conference,
{COCOA} 2011, Zhangjiajie, China, August 4-6, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6831},
pages = {16--30},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22616-8\_2},
doi = {10.1007/978-3-642-22616-8\_2},
timestamp = {Wed, 04 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/ChenFLS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HaramatySS11,
author = {Elad Haramaty and
Amir Shpilka and
Madhu Sudan},
editor = {Rafail Ostrovsky},
title = {Optimal Testing of Multivariate Polynomials over Small Prime Fields},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {629--637},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.61},
doi = {10.1109/FOCS.2011.61},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/HaramatySS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/RaoS11,
author = {B. V. Raghavendra Rao and
Jayalal Sarma},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Isomorphism testing of read-once functions and polynomials},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {115--126},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.115},
doi = {10.4230/LIPICS.FSTTCS.2011.115},
timestamp = {Sun, 06 Oct 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/RaoS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HaramatySS11,
author = {Elad Haramaty and
Amir Shpilka and
Madhu Sudan},
title = {Optimal testing of multivariate polynomials over small prime fields},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-059}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/059},
eprinttype = {ECCC},
eprint = {TR11-059},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HaramatySS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/GashkovG10,
author = {Sergej B. Gashkov and
Igor Gashkov},
title = {Some Remarks on Testing Irreducibility of Polynomials and Normality
of Bases in Finite Fields},
journal = {Fundam. Informaticae},
volume = {104},
number = {3},
pages = {227--238},
year = {2010},
url = {https://doi.org/10.3233/FI-2010-346},
doi = {10.3233/FI-2010-346},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fuin/GashkovG10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1007-2673,
author = {Zhixiang Chen and
Bin Fu},
title = {The Complexity of Testing Monomials in Multivariate Polynomials},
journal = {CoRR},
volume = {abs/1007.2673},
year = {2010},
url = {http://arxiv.org/abs/1007.2673},
eprinttype = {arXiv},
eprint = {1007.2673},
timestamp = {Wed, 04 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1007-2673.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1007-2675,
author = {Zhixiang Chen and
Bin Fu and
Yang Liu and
Robert T. Schweller},
title = {Algorithms for Testing Monomials in Multivariate Polynomials},
journal = {CoRR},
volume = {abs/1007.2675},
year = {2010},
url = {http://arxiv.org/abs/1007.2675},
eprinttype = {arXiv},
eprint = {1007.2675},
timestamp = {Wed, 04 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1007-2675.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChenF10a,
author = {Zhixiang Chen and
Bin Fu},
title = {The Complexity of Testing Monomials in Multivariate Polynomials},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-114}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/114},
eprinttype = {ECCC},
eprint = {TR10-114},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChenF10a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChenFLS10,
author = {Zhixiang Chen and
Bin Fu and
Yang Liu and
Robert T. Schweller},
title = {Algorithms for Testing Monomials in Multivariate Polynomials},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-122}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/122},
eprinttype = {ECCC},
eprint = {TR10-122},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChenFLS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/JutlaPRZ09,
author = {Charanjit S. Jutla and
Anindya C. Patthak and
Atri Rudra and
David Zuckerman},
title = {Testing low-degree polynomials over prime fields},
journal = {Random Struct. Algorithms},
volume = {35},
number = {2},
pages = {163--193},
year = {2009},
url = {https://doi.org/10.1002/rsa.20262},
doi = {10.1002/RSA.20262},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/JutlaPRZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DiakonikolasLMSW08,
author = {Ilias Diakonikolas and
Homin K. Lee and
Kevin Matulef and
Rocco A. Servedio and
Andrew Wan},
editor = {Luca Aceto and
Ivan Damg{\aa}rd and
Leslie Ann Goldberg and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Anna Ing{\'{o}}lfsd{\'{o}}ttir and
Igor Walukiewicz},
title = {Efficiently Testing Sparse {GF(2)} Polynomials},
booktitle = {Automata, Languages and Programming, 35th International Colloquium,
{ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
{I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
series = {Lecture Notes in Computer Science},
volume = {5125},
pages = {502--514},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-70575-8\_41},
doi = {10.1007/978-3-540-70575-8\_41},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/DiakonikolasLMSW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0805-1765,
author = {Ilias Diakonikolas and
Homin K. Lee and
Kevin Matulef and
Rocco A. Servedio and
Andrew Wan},
title = {Efficiently Testing Sparse {GF(2)} Polynomials},
journal = {CoRR},
volume = {abs/0805.1765},
year = {2008},
url = {http://arxiv.org/abs/0805.1765},
eprinttype = {arXiv},
eprint = {0805.1765},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0805-1765.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caine/Fadali07,
author = {M. Sami Fadali},
editor = {Gongzhu Hu},
title = {Stability Testing for Fuzzy Polynomials},
booktitle = {Proceedings of the {ISCA} 20th International Conference on Computer
Applications in Industry and Engineering, {CAINE} 2007, November 7-9,
2007, San Francisco, California, {USA}},
pages = {284--288},
publisher = {{ISCA}},
year = {2007},
timestamp = {Tue, 29 Jan 2008 07:45:48 +0100},
biburl = {https://dblp.org/rec/conf/caine/Fadali07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KaufmanR06,
author = {Tali Kaufman and
Dana Ron},
title = {Testing Polynomials over General Fields},
journal = {{SIAM} J. Comput.},
volume = {36},
number = {3},
pages = {779--802},
year = {2006},
url = {https://doi.org/10.1137/S0097539704445615},
doi = {10.1137/S0097539704445615},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/KaufmanR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/FilasetaM05,
author = {Michael Filaseta and
Douglas B. Meade},
title = {Irreducibility testing of lacunary 0, 1-polynomials},
journal = {J. Algorithms},
volume = {55},
number = {1},
pages = {21--28},
year = {2005},
url = {https://doi.org/10.1016/j.jalgor.2004.10.005},
doi = {10.1016/J.JALGOR.2004.10.005},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/FilasetaM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/moc/FilasetaS04,
author = {Michael Filaseta and
Andrzej Schinzel},
title = {On testing the divisibility of lacunary polynomials by cyclotomic
polynomials},
journal = {Math. Comput.},
volume = {73},
number = {246},
pages = {957--965},
year = {2004},
url = {https://doi.org/10.1090/S0025-5718-03-01589-8},
doi = {10.1090/S0025-5718-03-01589-8},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/moc/FilasetaS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JutlaPRZ04,
author = {Charanjit S. Jutla and
Anindya C. Patthak and
Atri Rudra and
David Zuckerman},
title = {Testing Low-Degree Polynomials over Prime Fields},
booktitle = {45th Symposium on Foundations of Computer Science {(FOCS} 2004), 17-19
October 2004, Rome, Italy, Proceedings},
pages = {423--432},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/FOCS.2004.64},
doi = {10.1109/FOCS.2004.64},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/JutlaPRZ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KaufmanR04,
author = {Tali Kaufman and
Dana Ron},
title = {Testing Polynomials over General Fields},
booktitle = {45th Symposium on Foundations of Computer Science {(FOCS} 2004), 17-19
October 2004, Rome, Italy, Proceedings},
pages = {413--422},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/FOCS.2004.65},
doi = {10.1109/FOCS.2004.65},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KaufmanR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CaiB03,
author = {Jin{-}yi Cai and
Eric Bach},
title = {On testing for zero polynomials by a set of points with bounded precision},
journal = {Theor. Comput. Sci.},
volume = {296},
number = {1},
pages = {15--25},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(02)00429-2},
doi = {10.1016/S0304-3975(02)00429-2},
timestamp = {Wed, 01 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CaiB03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/random/AlonKKLR03,
author = {Noga Alon and
Tali Kaufman and
Michael Krivelevich and
Simon Litsyn and
Dana Ron},
editor = {Sanjeev Arora and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Amit Sahai},
title = {Testing Low-Degree Polynomials over {GF(2(}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms
and Techniques, 6th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International
Workshop on Randomization and Approximation Techniques in Computer
Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2764},
pages = {188--199},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45198-3\_17},
doi = {10.1007/978-3-540-45198-3\_17},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/random/AlonKKLR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/LiptonV03,
author = {Richard J. Lipton and
Nisheeth K. Vishnoi},
title = {Deterministic identity testing for multivariate polynomials},
booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
pages = {756--760},
publisher = {{ACM/SIAM}},
year = {2003},
url = {http://dl.acm.org/citation.cfm?id=644108.644233},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/LiptonV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/automatica/Tits02,
author = {Andr{\'{e}} L. Tits},
title = {Comment on "The use of Routh array for testing the Hurwitz property
of a segment of polynomials"},
journal = {Autom.},
volume = {38},
number = {3},
pages = {559--560},
year = {2002},
url = {https://doi.org/10.1016/S0005-1098(01)00220-5},
doi = {10.1016/S0005-1098(01)00220-5},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/automatica/Tits02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/issac/Nagasaka02,
author = {Kosaku Nagasaka},
editor = {Teo Mora},
title = {Towards certified irreducibility testing of bivariate approximate
polynomials},
booktitle = {Symbolic and Algebraic Computation, International Symposium {ISSAC}
2002, Lille, France, July 7-10, 2002, Proceedings},
pages = {192--199},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/780506.780531},
doi = {10.1145/780506.780531},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/issac/Nagasaka02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/automatica/HwangY01,
author = {Chyi Hwang and
Shih{-}Feng Yang},
title = {The use of Routh array for testing the Hurwitz property of a segment
of polynomials},
journal = {Autom.},
volume = {37},
number = {2},
pages = {291--296},
year = {2001},
url = {https://doi.org/10.1016/S0005-1098(00)00142-4},
doi = {10.1016/S0005-1098(00)00142-4},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/automatica/HwangY01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijsysc/YangH01,
author = {Shih{-}Feng Yang and
Chyi Hwang},
title = {Testing the robust Schur stability of a segment of complex polynomials},
journal = {Int. J. Syst. Sci.},
volume = {32},
number = {10},
pages = {1243--1250},
year = {2001},
url = {https://doi.org/10.1080/00207720110035273},
doi = {10.1080/00207720110035273},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijsysc/YangH01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/CaiB01,
author = {Jin{-}yi Cai and
Eric Bach},
editor = {Jie Wang},
title = {On Testing for Zero Polynomials by a Set of Points with Bounded Precision},
booktitle = {Computing and Combinatorics, 7th Annual International Conference,
{COCOON} 2001, Guilin, China, August 20-23, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2108},
pages = {473--482},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44679-6\_53},
doi = {10.1007/3-540-44679-6\_53},
timestamp = {Wed, 01 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/CaiB01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KlivansS01,
author = {Adam R. Klivans and
Daniel A. Spielman},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Randomness efficient identity testing of multivariate polynomials},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {216--223},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380801},
doi = {10.1145/380752.380801},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KlivansS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KarpinskiPS00,
author = {Marek Karpinski and
Alfred J. van der Poorten and
Igor E. Shparlinski},
title = {Zero testing of p-adic and modular polynomials},
journal = {Theor. Comput. Sci.},
volume = {233},
number = {1-2},
pages = {309--317},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(99)00133-4},
doi = {10.1016/S0304-3975(99)00133-4},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KarpinskiPS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaecc/KarpinskiS99,
author = {Marek Karpinski and
Igor E. Shparlinski},
editor = {Marc P. C. Fossorier and
Hideki Imai and
Shu Lin and
Alain Poli},
title = {On the Computational Hardness of Testing Square-Freeness of Sparse
Polynomials},
booktitle = {Applied Algebra, Algebraic Algorithms and Error-Correcting Codes,
13th International Symposium, AAECC-13, Honolulu, Hawaii, USA, November
15-19, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1719},
pages = {492--497},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-46796-3\_47},
doi = {10.1007/3-540-46796-3\_47},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaecc/KarpinskiS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-027,
author = {Marek Karpinski and
Igor E. Shparlinski},
title = {On the Computational Hardness of Testing Square-Freeness of Sparse
Polynomials},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-027}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-027/index.html},
eprinttype = {ECCC},
eprint = {TR99-027},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-027.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jar/HongJ98,
author = {Hoon Hong and
Dalibor Jakus},
title = {Testing Positiveness of Polynomials},
journal = {J. Autom. Reason.},
volume = {21},
number = {1},
pages = {23--38},
year = {1998},
url = {https://doi.org/10.1023/A:1005983105493},
doi = {10.1023/A:1005983105493},
timestamp = {Wed, 02 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jar/HongJ98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Grigoriev97,
author = {Dima Grigoriev},
title = {Testing Shift-Equivalence of Polynomials by Deterministic, Probabilistic
and Quantum Machines},
journal = {Theor. Comput. Sci.},
volume = {180},
number = {1-2},
pages = {217--228},
year = {1997},
url = {https://doi.org/10.1016/S0304-3975(96)00188-0},
doi = {10.1016/S0304-3975(96)00188-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Grigoriev97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/RubinfeldS96,
author = {Ronitt Rubinfeld and
Madhu Sudan},
title = {Robust Characterizations of Polynomials with Applications to Program
Testing},
journal = {{SIAM} J. Comput.},
volume = {25},
number = {2},
pages = {252--271},
year = {1996},
url = {https://doi.org/10.1137/S0097539793255151},
doi = {10.1137/S0097539793255151},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/RubinfeldS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/issac/Grigoriev96,
author = {Dima Grigoriev},
editor = {Erwin Engeler and
Bob F. Caviness and
Yagati N. Lakshman},
title = {Testing Shift-Equivalence of Polynomials Using Quantum Machines},
booktitle = {Proceedings of the 1996 International Symposium on Symbolic and Algebraic
Computation, {ISSAC} '96, Zurich, Switzerland, July 24-26, 1996},
pages = {49--54},
publisher = {{ACM}},
year = {1996},
url = {https://doi.org/10.1145/236869.236897},
doi = {10.1145/236869.236897},
timestamp = {Tue, 29 Aug 2023 20:47:14 +0200},
biburl = {https://dblp.org/rec/conf/issac/Grigoriev96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jss/OmanH94,
author = {Paul W. Oman and
Jack R. Hagemeister},
title = {Construction and testing of polynomials predicting software maintainability},
journal = {J. Syst. Softw.},
volume = {24},
number = {3},
pages = {251--266},
year = {1994},
url = {https://doi.org/10.1016/0164-1212(94)90067-1},
doi = {10.1016/0164-1212(94)90067-1},
timestamp = {Mon, 24 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jss/OmanH94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ClausenDGK91,
author = {Michael Clausen and
Andreas W. M. Dress and
Johannes Grabmeier and
Marek Karpinski},
title = {On Zero-Testing and Interpolation of k-Sparse Multivariate Polynomials
Over Finite Fields},
journal = {Theor. Comput. Sci.},
volume = {84},
number = {2},
pages = {151--164},
year = {1991},
url = {https://doi.org/10.1016/0304-3975(91)90157-W},
doi = {10.1016/0304-3975(91)90157-W},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ClausenDGK91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GemmellLRSW91,
author = {Peter Gemmell and
Richard J. Lipton and
Ronitt Rubinfeld and
Madhu Sudan and
Avi Wigderson},
editor = {Cris Koutsougeras and
Jeffrey Scott Vitter},
title = {Self-Testing/Correcting for Polynomials and for Approximate Functions},
booktitle = {Proceedings of the 23rd Annual {ACM} Symposium on Theory of Computing,
May 5-8, 1991, New Orleans, Louisiana, {USA}},
pages = {32--42},
publisher = {{ACM}},
year = {1991},
url = {https://doi.org/10.1145/103418.103429},
doi = {10.1145/103418.103429},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GemmellLRSW91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsc/RislerR90,
author = {Jean{-}Jacques Risler and
F. Ronga},
title = {Testing Polynomials},
journal = {J. Symb. Comput.},
volume = {10},
number = {1},
pages = {1--6},
year = {1990},
url = {https://doi.org/10.1016/S0747-7171(08)80033-8},
doi = {10.1016/S0747-7171(08)80033-8},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsc/RislerR90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Gathen89,
author = {Joachim von zur Gathen},
title = {Testing Permutation Polynomials (Extended Abstract)},
booktitle = {30th Annual Symposium on Foundations of Computer Science, Research
Triangle Park, North Carolina, USA, 30 October - 1 November 1989},
pages = {88--92},
publisher = {{IEEE} Computer Society},
year = {1989},
url = {https://doi.org/10.1109/SFCS.1989.63460},
doi = {10.1109/SFCS.1989.63460},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Gathen89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsc/Kaltofen87,
author = {Erich L. Kaltofen},
title = {Deterministic Irreducibility Testing of Polynomials over Large Finite
Fields},
journal = {J. Symb. Comput.},
volume = {4},
number = {1},
pages = {77--82},
year = {1987},
url = {https://doi.org/10.1016/S0747-7171(87)80055-X},
doi = {10.1016/S0747-7171(87)80055-X},
timestamp = {Mon, 03 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsc/Kaltofen87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AdlemanO81,
author = {Leonard M. Adleman and
Andrew M. Odlyzko},
title = {Irreducibility Testing and Factorization of Polynomials (Extended
Abstract)},
booktitle = {22nd Annual Symposium on Foundations of Computer Science, Nashville,
Tennessee, USA, 28-30 October 1981},
pages = {409--418},
publisher = {{IEEE} Computer Society},
year = {1981},
url = {https://doi.org/10.1109/SFCS.1981.20},
doi = {10.1109/SFCS.1981.20},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AdlemanO81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HeintzS80,
author = {Joos Heintz and
Claus{-}Peter Schnorr},
editor = {Raymond E. Miller and
Seymour Ginsburg and
Walter A. Burkhard and
Richard J. Lipton},
title = {Testing Polynomials which Are Easy to Compute (Extended Abstract)},
booktitle = {Proceedings of the 12th Annual {ACM} Symposium on Theory of Computing,
April 28-30, 1980, Los Angeles, California, {USA}},
pages = {262--272},
publisher = {{ACM}},
year = {1980},
url = {https://doi.org/10.1145/800141.804674},
doi = {10.1145/800141.804674},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/HeintzS80.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.
retrieved on 2024-10-17 14:09 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
