Applications of matrix methods to the theory of lower bounds in computational complexity
Author:
- 1 March 1990
- journal article
- research article
- Published by Springer Nature in Combinatorica
- Vol. 10 (1) , 81-93
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- The gap between monotone and non-monotone circuit complexity is exponentialCombinatorica, 1988
- Monotone circuits for connectivity require super-logarithmic depth1988
- On different modes of communication1988
- The monotone circuit complexity of boolean functionsCombinatorica, 1987
- Complexity classes in communication complexity theory1986
- Relating monotone formula size and monotone depth of boolean functionsInformation Processing Letters, 1983
- Fast parallel matrix and GCD computationsInformation and Control, 1982
- Lower bounds for VLSI1981
- Some complexity questions related to distributive computing(Preliminary Report)1979
- A Combinatorial Problem in the k-Adic Number SystemProceedings of the American Mathematical Society, 1967