A probabilistic algorithm for verifying polynomial middle product in linear time

Pascal Giorgi

Open source

DOI
10.1016/j.ipl.2018.06.014
Published
2018-11
Container
Information Processing Letters
Publisher
Elsevier BV
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1016/j.ipl.2018.06.014,
  title = {A probabilistic algorithm for verifying polynomial middle product in linear time},
  author = {Pascal Giorgi},
  year = {2018},
  journal = {Information Processing Letters},
  doi = {10.1016/j.ipl.2018.06.014},
  url = {https://doi.org/10.1016/j.ipl.2018.06.014}
}

RIS

TY  - JOUR
TI  - A probabilistic algorithm for verifying polynomial middle product in linear time
AU  - Pascal Giorgi
PY  - 2018
JO  - Information Processing Letters
DO  - 10.1016/j.ipl.2018.06.014
UR  - https://doi.org/10.1016/j.ipl.2018.06.014
ER  - 

APA

Giorgi, P. (2018). A probabilistic algorithm for verifying polynomial middle product in linear time. Information Processing Letters. https://doi.org/10.1016/j.ipl.2018.06.014

Source records