On the power of straight- line computations in finite fields

DOI10.1109/TIT.1982.1056592zbMATH Open0493.68044MaRDI QIDQ3956397FDOQ3956397

Authors: Abraham Lempel, Gadiel Seroussi, Jacob Ziv 

Publication date: 1982

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

zbMATH Keywords

straight-line complexitynetwork complexityfunctions over a finite fieldproduct of run time and program size of Turing machines

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Finite fields and commutative rings (number-theoretic aspects) (11T99)

Cited In (1)

• Boolean circuits versus arithmetic circuits

This page was built for publication: On the power of straight- line computations in finite fields

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