On the Complexity of Computing Prime Tables

DOI10.1007/978-3-662-48971-0_57zbMath1417.68066arXiv1504.05240OpenAlexW1505880561WikidataQ56059195 ScholiaQ56059195MaRDI QIDQ3459904

Martín Farach-Colton, Meng-Tsung Tsai

Publication date: 11 January 2016

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.05240

zbMATH Keywords

lower boundmultiplicationfactorialprime tables

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Number-theoretic algorithms; complexity (11Y16) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Primality (11Y11)

Related Items (2)

ON THE COMPLEXITY OF COMPUTING PRIME TABLES ON THE TURING MACHINE ⋮ Volume computation for sparse Boolean quadric relaxations

This page was built for publication: On the Complexity of Computing Prime Tables