**2**Author(s)

By Topic

- Aerospace
- Bioengineering
- Communication, Networking & Broadcasting
- Components, Circuits, Devices & Systems
- Computing & Processing (Hardware/Software)
- Engineered Materials, Dielectrics & Plasmas

Let ^{n }→^{n} be a bijection with the property that both ^{-1} are computable using only arithmetic operations from ^{-1}. They give strong relations between the complexity of ^{-1} when ^{-1} has a polynomial-size arithmetic circuit. Furthermore, this result is uniform in the sense that there is an efficient algorithm for finding such a circuit for ^{-1}, given such a circuit for ^{n}→^{n} bijection, there always exists an automorphism defining that bijection. This is not generally true for an arbitrary finite field

- Page(s):
- 327 - 334 vol.1
- Meeting Date :
- 22 Oct 1990-24 Oct 1990
- Print ISBN:
- 0-8186-2082-X
- INSPEC Accession Number:
- 3908515

- Conference Location :
- St. Louis, MO
- DOI:
- 10.1109/FSCS.1990.89551
- Publisher:
- IEEE