Polynomial-time pseudodeterministic construction of primes

DOI10.1109/FOCS57990.2023.00074MaRDI QIDQ6942896zbMATH OpenFDO

Authors Zhenjian Lu, Lijie Chen, Igor C. Oliveira, Rahul Santhanam, Hanlin Ren

Publication date 15 August 2025

Full work available at URL https://wrap.warwick.ac.uk/179360/1/WRAP-Polynomial-time-pseudodeterministic-construction-primes-23.pdf

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(4)

• Feasibility of primality in bounded arithmetic
• Symmetric exponential time requires near-maximum circuit size
• Pseudo-deterministic construction of irreducible polynomials over finite fields
• Towards free lunch derandomization from necessary assumptions (and OWFs)

This page was built for publication: Polynomial-time pseudodeterministic construction of primes

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