Hardness assumptions in the foundations of theoretical computer science

Archive for Mathematical Logic 44 (6):667-675 (2005)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,923

External links

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

Through your library

Similar books and articles

How Digital Computer Simulations Explain Real‐World Processes.Ulrich Krohs - 2008 - International Studies in the Philosophy of Science 22 (3):277 – 292.
Tautologies from pseudo-random generators.Jan Krajíček - 2001 - Bulletin of Symbolic Logic 7 (2):197-212.
Computer Simulation in the Physical Sciences.Fritz Rohrlich - 1990 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1990:507-518.
On teaching computer ethics within a computer science department.Michael J. Quinn - 2006 - Science and Engineering Ethics 12 (2):335-343.
Computation and automata.Arto Salomaa - 1985 - New York: Cambridge University Press.

Analytics

Added to PP
2013-11-23

Downloads
67 (#248,300)

6 months
9 (#354,585)

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

Bounded arithmetic, propositional logic, and complexity theory.Jan Krajíček - 1995 - New York, NY, USA: Cambridge University Press.
Tautologies from pseudo-random generators.Jan Krajíček - 2001 - Bulletin of Symbolic Logic 7 (2):197-212.
Algorithms for quantum computation: Discrete logarithms and factoring.P. Shor - 1994 - Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science:124-134.

View all 6 references / Add more references