scholar.google.com › citations
We investigate the computational power of finite-field arithmetic operations as compared to Boolean operations.
The Computational Efficacy of. Finite Field Arithmetic. Gudmund Frandsen. Carl Sturtivant. DAIMI PB - 227. August 1987. AARHUS UNIVERSITY. COMPUTER SCIENCE ...
We show that there exists an interesting non-uniform model of computational complexity within characteristic-two finite fields. This model regards all problems ...
We investigate the computational power of finite-field arithmetic operations as compared to Boolean operations.
We define a good representation of the finite fields to be essentially one in which the field arithmetic operations have polynomial-size Boolean circuits.
Healy AViola E(2006)Constant-Depth circuits for arithmetic in finite fields of characteristic twoProceedings of the 23rd Annual conference on Theoretical ...
Original language, English. Journal, Theoretical Computer Science. Volume, 112. Issue, 2. Pages (from-to), 291-309. Number of pages, 19. ISSN, 0304-3975.
TL;DR: This thesis explores the applications of pseudorandomness within complexity theory, with a focus on pseudOrandomness that can be constructed ...
Oct 22, 2024 · PDF | We give a review of some works on the complexity of implementation of arithmetic operations in finite fields by Boolean circuits.
Missing: Efficacy | Show results with:Efficacy
The computational efficacy of finite-field arithmetic. Sturtivant, C.; Skovbjerg Frandsen, G. Theoretical Computer Science 112(2): 291-309. 1993. ISSN/ISBN ...