Lower bounds for arithmetic problems (Q1178201)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 23320
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds for arithmetic problems |
scientific article; zbMATH DE number 23320 |
Statements
Lower bounds for arithmetic problems (English)
0 references
26 June 1992
0 references
The author shows that the method developed by \textit{Y. Mansour}, \textit{B. Schieber}, and \textit{P. Tiwari} [SIAM J. Comput. 20, No.\ 2, 315-327 (1991; Zbl 0724.68051)] can be used to obtain the lower bounds for the following arithmetic problems: primality testing, modular exponentiation, Jacobi symbol.
0 references
lower bounds
0 references
primality testing
0 references
modular exponentiation
0 references
Jacobi symbol
0 references
0.7661327123641968
0 references
0.7627912163734436
0 references
0.7573673129081726
0 references
0.713308572769165
0 references
0.7090736031532288
0 references
