- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Review: Uwe Schoning, Complexity and Structure [Book Review]
Journal of Symbolic Logic 54 (3):1106-1107 (1989)
Abstract
This article has no associated abstract. (fix it)Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Review: Uwe Schoning, Logic for Computer Scientists. [REVIEW]Dirk Siefkes - 1991 - Journal of Symbolic Logic 56 (2):761-762.
Schöning Uwe. Complexity and structure. Lecture notes in computer science, vol. 211. Springer-Verlag, Berlin, Heidelberg, New York, and Tokyo, 1986, v + 99 pp. [REVIEW]Stephen R. Mahaney - 1989 - Journal of Symbolic Logic 54 (3):1106-1107.
Uwe Schöning. Complexity theory and interaction. The universal Turing machine, A half-century survey, edited by Rolf Herken, Kammerer & Unverzagt, Hamburg and Berlin, and Oxford University Press, Oxford and New York, 1988. pp. 561–580. [REVIEW]Steven Lindell - 1991 - Journal of Symbolic Logic 56 (3):1091-1092.
Uwe Schöning. Logik für Informatiker. Second revised edition. Reihe Informatik, vol. 56. B. I. Wissenschaftsverlag, Mannheim, Vienna, and Zurich, 1989, 172 pp. - Uwe Schöning. Logic for computer scientists. English translation of the preceding. Progress in computer science and applied logic, vol. 8. Birkhäuser, Boston, Basel, and Berlin, 1989, ix + 166 pp. [REVIEW]Dirk Siefkes - 1991 - Journal of Symbolic Logic 56 (2):761-762.
Gems of theoretical computer science, Uwe schöning and Randall Pruim.Rohit Parikh - 2000 - Journal of Logic, Language and Information 9 (1):131-132.
Uwe Schoning and Randall Pruim, Gems of Theoretical Computer Science.R. Parikh - 2000 - Journal of Logic Language and Information 9 (1):131-132.
Review: R. G. Downey, M. R. Fellows, Parameterized Complexity. [REVIEW]Jörg Flum - 2002 - Bulletin of Symbolic Logic 8 (4):528-529.
Review: Hans Kamp, Uwe Monnich, The Paradox of the Heap. [REVIEW]Kenton F. Machina - 1984 - Journal of Symbolic Logic 49 (3):991-993.
Review: J. Hartmanis, R. E. Stearns, On the Computational Complexity of Algorithms. [REVIEW]Jiri Becvar - 1967 - Journal of Symbolic Logic 32 (1):120-121.
Review: J. Hartmanis, R. E. Stearns, Computational Complexity of Recursive Sequences. [REVIEW]Jiri Becvar - 1967 - Journal of Symbolic Logic 32 (1):121-122.
Analytics
Added to PP
2013-11-03
Downloads
5 (#1,559,645)
6 months
2 (#1,445,852)
2013-11-03
Downloads
5 (#1,559,645)
6 months
2 (#1,445,852)
Historical graph of downloads
Citations of this work
Complexity-theoretic algebra II: Boolean algebras.A. Nerode & J. B. Remmel - 1989 - Annals of Pure and Applied Logic 44 (1-2):71-99.
On the lattices of NP-subspaces of a polynomial time vector space over a finite field.Anil Nerode & J. B. Remmel - 1996 - Annals of Pure and Applied Logic 81 (1-3):125-170.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6686886f5-xdvnm uwo