On the power of straight- line computations in finite fields
- 1 November 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 28 (6) , 875-880
- https://doi.org/10.1109/tit.1982.1056592
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A 3n-lower bound on the network complexity of Boolean functionsTheoretical Computer Science, 1980
- Relations Among Complexity MeasuresJournal of the ACM, 1979
- Two theorems on random polynomial timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- Complexity measures and hierarchies for the evaluation of integers and polynomialsTheoretical Computer Science, 1976
- On the combinational complexity of certain symmetric Boolean functionsTheory of Computing Systems, 1976
- Information theory and the complexity of boolean functionsTheory of Computing Systems, 1976
- The network complexity and the Turing machine complexity of finite functionsActa Informatica, 1976
- Computational Work and Time on Finite MachinesJournal of the ACM, 1972
- On the number of multiplications necessary to compute certain functionsCommunications on Pure and Applied Mathematics, 1970