Normal view MARC view ISBD view

The computational complexity of logical theories / Jeanne Ferrante, Charles W. Rackoff

Auteur principal : Ferrante, Jeanne, 1949-, AuteurCo-auteur : Rackoff, Charles W., 1948-, AuteurType de document : MonographieCollection : Lecture notes in mathematics, 718Langue : anglais.Pays : Allemagne.Éditeur : Berlin : Springer, 1979Description : 1 vol. (X-243 p.) ; 24 cmISBN : 9783540095019.ISSN : 0075-8434.Bibliographie : Bibliogr. p. [234]-238. Index.Sujet MSC : 03D15, Computability and recursion theory, Complexity of computation (including implicit computational complexity)
03B25, General logic, Decidability of theories and sets of sentences
03D10, Computability and recursion theory, Turing machines and related notions
En-ligne : sur Springerlink
Tags from this library: No tags from this library for this title. Log in to add tags.
Current location Call number Status Date due Barcode
CMI
Salle R
03 FER (Browse shelf) Available 07120-01

Bibliogr. p. [234]-238. Index

There are no comments for this item.

Log in to your account to post a comment.