The complexity of iterated multiplication
- 7 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- On Threshold Circuits and Polynomial ComputationSIAM Journal on Computing, 1992
- Expressibility and Parallel ComplexitySIAM Journal on Computing, 1989
- The method of forced enumeration for nondeterministic automataActa Informatica, 1988
- Nondeterministic Space is Closed under ComplementationSIAM Journal on Computing, 1988
- Problems complete for deterministic logarithmic spaceJournal of Algorithms, 1987
- Languages that Capture Complexity ClassesSIAM Journal on Computing, 1987
- A taxonomy of problems with fast parallel algorithmsInformation and Control, 1985
- On computing the determinant in small parallel time using a small number of processorsInformation Processing Letters, 1984
- On uniform circuit complexityJournal of Computer and System Sciences, 1981
- Some Remarks on Generalized SpectraMathematical Logic Quarterly, 1977