Abstract
Highly parallel algorithms computing the inverse, discrete roots, or a large power modulo a number that has only small prime factors are presented. The elaborated uniform families of Boolean circuits simultaneously achieve depth O (log n ) and size O ( n 0(1) ) for P -uniformity and depth O (log n log log n ) and size O ( n 0(1) ) for log-space uniformity.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
