The complexity of negation-limited networks - a brief survey

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 33 LNCS, Issue , 1975, Pages 71-82

  Fischer, Michael J ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85017390947     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-07407-4_9     Document Type: Conference Paper

References (27)

1. Batcher, K.E., Sorting networks and their applications, Proc. AFIPS Spring Joint Computer Conference, Vol. 32, AFIPS Press, Montvale, N.J., (1968), 296-291.
2. Ehrenfeucht, A., Practical decidability, Report CU-CS-008-72, Dept. of Computer Science, Univ. of Colorado, Boulder, Colo., (1972), 14 pp.
3. Fischer, M.J., Lectures on network complexity, University of Frankfurt, Germany, June 1974, 25 pp.
4. Fischer M.J., and A.R. Meyer, Boolean matrix multiplication and transitive closure, Proc. 12th IEEE Symp. on Switching and Automata Theory (1971), 129-131.
5. Fischer, M.J. and M.O. Rabin, Super-exponential complexity of Presburger arithmetic. In Complexity of Computation, SIAM-AMS Proceedings, Vol. 7 (1974), 27-41.
6. Hsieh, W.N., L.H. Harper and J.E. Savage, A class of Boolean functions with linear combinational complexity, MAC Technical Memorandum 55, M.I.T. Project MAC, Cambridge, Mass. (1974), 38 pp.
7. Lamagna, E.A. and J.E. Savage, Combinational complexity of some monotone functions, Proc. 15th IEEE Symp. on Switching and Automata Theory (1974), 140-144.
8. Lupanov, O.B., A method of circuit synthesis, Izvestia v.u.z. Radiafizike, No. 1 (1958), 120-140.
9. Markov, A.A., On the inversion complexity of a system of functions, J. ACM 5, 4 (1958), 331-334.
10. Mehlhorn, K., On the complexity of monotone realizations of matrix multiplication, Technical report A74-11, Fachbereich Angewandte Mathematik und Informatik, Universität des Saarlandes, Saarhrucken, Germany (1974), 17 pp.
11. Meyer, A.R., Private communication.
12. Muller, D.E. and F.P. Preparata, Bounds to complexities of networks for sorting and for switching, J. ACM 22, 2 (1975), 195-201.
13. Nakamura, K., N. Tokura, and T. Kasami, Minimal negative gate networks, IEEE Trans. Comp., Vol. C-21, No. 1 (1972), 5-11.
14. Paterson, M.S., Complexity of monotone networks for Boolean matrix product, Theoretical Computer Science 1, 1 (1975), to appear.
15. Paul, W.J., A 2.5 N-lower bound on the combinational complexity of Boolean functions, Proc. 7th ACM Symp. on Theory of Computing (1975), 27-36.
16. Pippenger, N., Private communication.
17. Pippenger, N., and M.J. Fischer, Relationships among complexity measures, in preparation.
18. Pratt, V.R., The power of negative thinking in multiplying Boolean matrices, Proc. 6th ACM Symp. on Theory of Computing (1974), 80-83.
19. Presburger, M., Über die Vollständigkeit eines gewissen Systems der Arithmetic ganzer Zahlen in welchem die Addition als einzige Operation hervortritt. Comptes-rendus du I Congrès des Mathèmaticiens des Pays Slaves, Warsaw (1930), 92-101, 395.
20. Savage, J.E., Computational work and time on finite machines, J. ACM 19, 4 (1972), 660-674.
21. Savage, J.E., The Complexity o f Computing, manuscript, 1974.
22. Schnorr, C.P., The network complexity and the Turing machine complexity of finite functions, manuscript, University of Frankfurt, Germany (1975), 18 pp.
23. Schnorr, C.P., The combinational complexity of equivalence, Theoretical Computer Science, to appear.
24. Schnorr, C.P., Zwei lineare untere Schranken fur die Komplexität Boolescher Funktionen, Computing 13 (1974), 155-171.
25. Stockmeyer, L.J., The complexity of decision problems in automata theory and logic, Project MAC Technical Report 133, M.I.T., Cambridge, Mass. (1974), 224 pp.
26. Strassen, V., Berechnungen in partiellen Algebren endlichen Typs, Computing 11 (1973), 181-196.
27. Valiant, L.G., On non-linear lower bounds in computational complexity, Proc. 7th ACM Symposium on Theory of Computing (1975), 45-52.