M. S. Paterson. Complexity of matrix algorithms. Foundations of computer science, edited by J. W. de Bakker, Mathematical Centre Tracts 63, Mathematisch Centrum, Amsterdam1975, pp. 179–215 [Book Review]

Journal of Symbolic Logic 42 (3):422 (1977)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272872

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

E. J. Neuhold. Formal properties of data bases. Foundations of computer science, edited by J. W. de Bakker, Mathematical Centre Tracts 63, Mathematisch Centrum, Amsterdam1975, pp. 119–177. [REVIEW]Wiktor Marek - 1977 - Journal of Symbolic Logic 42 (3):421-422.
Engeler E.. Algorithmic logic. Foundations of computer science, edited by de Bakker J. W., Mathematical Centre Tracts 63, Mathematisch Centrum, Amsterdam 1975, pp. 55–85. [REVIEW]Andrzej Salwicki - 1977 - Journal of Symbolic Logic 42 (3):420-421.
J. W. de Barker. The fixed point approach in semantics: theory and applications. Foundations of computer science, edited by J. W. de Bakker, Mathematical Centre Tracts 63, Mathematisch Centrum, Amsterdam1975, pp. 1–53. [REVIEW]Andrzej Blikle - 1977 - Journal of Symbolic Logic 42 (3):419-420.
D. M. R. Leivant. Absoluteness of intuitionistic logic. Mathematical Centre tracts, no. 73. Mathematisch Centrum, Amsterdam1979, ix + 137 pp. [REVIEW]G. E. Minc - 1981 - Journal of Symbolic Logic 46 (4):873-874.
de Roever W. P. Jr., Recursive program schemes: semantics and proof theory. Mathematical Centre tracts, no. 70. Mathematisch Centrum, Amsterdam 1976, ix + 112 pp. [REVIEW]Peter Lauer - 1979 - Journal of Symbolic Logic 44 (4):658-659.
Review: M. S. Paterson, Complexity of Matrix Algorithms. [REVIEW]Witold Lipski - 1977 - Journal of Symbolic Logic 42 (3):422-422.
Complexity of Matrix Algorithms.M. S. Paterson - 1977 - Journal of Symbolic Logic 42 (3):422-422.
A. Bertoni. Mathematical methods of the theory of stochastic automata. Mathematical foundations of computer science, 3rd symposium at Jadwisin near Warsaw, June 17–22, 1974, edited by A. Blikle, Lecture notes in computer science, vol. 28, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 9–22. - R. V. Freivald. Functions computable in the limit by probabilistic machines. Mathematical foundations of computer science, 3rd symposium at Jadwisin near Warsaw, June 17–22, 1974, edited by A. Blikle, Lecture notes in computer science, vol. 28, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 77–87. - B. Goetze and R. Klette. Some properties of limit recursive functions. Mathematical foundations of computer science, 3rd symposium at Jadwisin near Warsaw, June 17–22, 1974, edited by A. Blikle, Lecture notes in computer science, vol. 28, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 88–90. - Ole-Johan Dahl. An approach to correctness proofs of semicoroutines. [REVIEW]Steven S. Muchnick - 1977 - Journal of Symbolic Logic 42 (3):422-423.
Mathematical Foundations of Computer Science 1990 Banská Bystrica, Czechoslovakia, August 27-31, 1990 : Proceedings.B. Rovan & Symposium on Mathematical Foundations of Computer Science - 1990
Algorithms and the mathematical foundations of computer science.W. Dean - forthcoming - Notre Dame Journal of Formal Logic.
Mathematical Foundations of Computer Science 1991 16th International Symposium, Kazimierz Dolny, Poland, September 9-13, 1991 : Proceedings.Andrzej Tarlecki & International Symposium on Mathematical Foundations of Computer Science - 1991
P-functions and Boolean Matrix Factorization: A Unified Approach for Wired, Programmed, and Microprogrammed Implementations of Discrete Algorithms.André Thayse - 1984 - Springer.
Vaughan R. Pratt. Semantical considerations on Floyd–Hoare logic. 17th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, New York1976, pp. 109–121. - Michael J. Fischer and Richard E. Ladner. Propositional dynamic logic of regular programs. Journal of computer and system sciences, vol. 18 , pp. 194–211. - Krister Segerberg. A completeness theorem in the modal logic of programs. Universal algebra and applications. Papers presented at Stefan Banach International Mathematical Center at the semester “Universal algebra and applications” held February 15–June 9, 1978, edited by Tadeuz Traczyk, Banach Center Publications, vol. 9, PWN—Polish Scientific Publishers, Warsaw1982, pp. 31–46. - Rohit Parikh. The completeness of propositional dynamic logic. Mathematical foundations of computer science 1978, Proceedings, 7th symposium, Zakopane, Poland, September 4–8, 1978, edited by J. Winkowski, Lecture notes in computer science, vol. 64, Springe. [REVIEW]Robert Goldblatt - 1986 - Journal of Symbolic Logic 51 (1):225-227.
Patrick Blackburn, Maarten de Rijke and Yde Venema, Modal Logic, Cambridge Tracts in Theoretical Computer Science vol. 53. [REVIEW]Valentin Goranko - 2004 - Studia Logica 76 (1):135-142.
Tractability and the computational mind.Rineke Verbrugge & Jakub Szymanik - 2018 - In Mark Sprevak & Matteo Colombo (eds.), The Routledge Handbook of the Computational Mind. Routledge. pp. 339-353.

Analytics

Added to PP
2016-06-30

Downloads
22 (#669,532)

6 months
4 (#698,851)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references