Polynomial algorithms for primality testing in algebraic number fieldswith class number 1
From MaRDI portal
Publication:6656650
DOI10.1007/S10958-024-07529-8MaRDI QIDQ6656650
Nikita Kondratyonok, Nikolai Prochorov, Maksim Vaskouski
Publication date: 3 January 2025
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Algebraic number theory: global fields (11Rxx) Computational number theory (11Yxx) Elementary number theory (11Axx)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Primes in quadratic unique factorization domains
- Carmichael numbers in number rings
- Probabilistic algorithm for testing primality
- Riemann's hypothesis and tests for primality
- Erratum: ``PRIMES is in P
- Explicit Bounds for Primality Testing and Related Problems
- A Fast Monte-Carlo Test for Primality
- Detecting perfect powers in essentially linear time
- Advanced Topics in Computional Number Theory
- Automata, Languages and Programming
This page was built for publication: Polynomial algorithms for primality testing in algebraic number fieldswith class number 1
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6656650)
