On the complexity of testing primality by homogeneous structures

DOI10.1515/156939203322556027MaRDI QIDQ4809633zbMATH OpenOpenAlexFDO

Authors A. M. Stepanenkov

Publication date 30 August 2004

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/156939203322556027

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cellular automata (computational aspects) (68Q80) Primality (11Y11)

Recommendations

• Primality testing in polynomial time
• scientific article; zbMATH DE number 2123628
• Recent developments in primality testing
• Decision problem \texttt{PRIMES}
• Primality testing

Cited in

(2)

• An approach for testing the primeness of attributes in relational schemas
• Linear-Time Version of Holub’s Algorithm for Morphic Imprimitivity Testing

This page was built for publication: On the complexity of testing primality by homogeneous structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4809633)