Lower bounds on monotone complexity of the logical permanent
- 1 June 1985
- journal article
- research article
- Published by Springer Nature in Mathematical Notes
- Vol. 37 (6) , 485-493
- https://doi.org/10.1007/bf01157687
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- Boolean functions whose monotone complexity is of size n2log nTheoretical Computer Science, 1982
- A new lower bound on the monotone network complexity of Boolean sumsActa Informatica, 1980
- Switching functions whose monotone complexity is nearly quadraticTheoretical Computer Science, 1979
- The Power of Negative Thinking in Multiplying Boolean MatricesSIAM Journal on Computing, 1975
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973