Factoring and testing primes in small space

DOI10.1051/ita/2013038zbMath1315.11100OpenAlexW2058300963MaRDI QIDQ5397718

Dana Pardubská, Viliam Geffert

Publication date: 24 February 2014

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/b1ba531b0b502e054b1feb9801b44f79eb400e80

zbMATH Keywords

computational complexityprime numbersfactoringsublogarithmic space

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Factorization; primality (11A51)

Related Items (1)

Binary coded unary regular languages

This page was built for publication: Factoring and testing primes in small space