Computational Complexity

&
Journal of Symbolic Logic 54 (2):622-624 (1989)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2274881

Links

PhilArchive



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

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

Review: K. Wagner, G. Wechsung, Computational Complexity. [REVIEW]Peter van Emde Boas - 1989 - Journal of Symbolic Logic 54 (2):622-624.
Complexity and postmodernism: understanding complex systems.Paul Cilliers - 1998 - New York: Routledge.
The Computational Complexity of Quantified Reciprocals.Jakub Szymanik - 2009 - In Peter Bosch, David Gabelaia & Jérôme Lang (eds.), Lecture Notes on Artificial Intelligence 5422, Logic, Language, and Computation 7th International Tbilisi Symposium on Logic, Language, and Computation. Springer.
Wagner K. and Wechsung G., Computational complexity, Mathematics and its applications. VEB Deutscher Verlag der Wissenschaften, Berlin, and D. Reidel Publishing Company, Dordrecht etc., 1986, 551 pp. [REVIEW]Peter van Emde Boas - 1989 - Journal of Symbolic Logic 54 (2):622-624.
Computational complexity and Godel's incompleteness theorem.Gregory J. Chaitin - 1970 - [Rio de Janeiro,: Centro Técnico Científico, Pontifícia Universidade Católica do Rio de Janeiro. Edited by Gregory J. Chaitin.
Computational model theory: an overview.M. Vardi - 1998 - Logic Journal of the IGPL 6 (4):601-624.
Logic and Computational Complexity International Workshop Lcc '94, Indianapolis, in, Usa, October 13-16, 1994 : Selected Papers'.Daniel Leivant - 1995 - Springer Verlag.
Deterministic chaos and computational complexity: The case of methodological complexity reductions. [REVIEW]Theodor Leiber - 1999 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 30 (1):87-101.
The computational complexity of logical theories.Jeanne Ferrante - 1979 - New York: Springer Verlag. Edited by Charles W. Rackoff.
Complexity in Physics and Technology.Manuel S. Garrido & Rui Vilela Mendes - 1992 - World Scientific.
Computational complexity of some Ramsey quantifiers in finite models.Marcin Mostowski & Jakub Szymanik - 2007 - Bulletin of Symbolic Logic 13:281--282.
Computation models for parameterized complexity.Marco Cesati & Miriam Dilanni - 1997 - Mathematical Logic Quarterly 43 (2):179-202.
Computational complexity analysis can help, but first we need a theory.Todd Wareham, Iris van Rooij & Moritz Müller - 2008 - Behavioral and Brain Sciences 31 (4):399-400.
Computational Complexity of Polyadic Lifts of Generalized Quantifiers in Natural Language.Jakub Szymanik - 2010 - Linguistics and Philosophy 33 (3):215-250.
Approximation to measurable functions and its relation to probabilistic computation.Ker-I. Ko - 1986 - Annals of Pure and Applied Logic 30 (2):173-200.

Analytics

Added to PP
2015-02-05

Downloads
40 (#395,904)

6 months
7 (#419,303)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On Sparse Complete Sets.Gerd Wechsung - 1985 - Mathematical Logic Quarterly 31 (14-18):281-287.

View all 9 citations / Add more citations

References found in this work

No references found.

Add more references