cover image

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

; Rackoff, Charles W., 1948- author
Berlin ; New York : Springer-Verlag, 1979.
ISBN 0387095012, 9783540095019, 3540095012, 9780387095011

Location Call Number Status Consortium Loan
George Washington
WRLC Shared Collections Facility
QA 3 .L28 no.718 (show me on map) Off-site
Request
American
WRLC Shared Collections Facility
No.716-718 bound together. Held at WRLC Center; available for delivery
WRLC Shared Collections Facility
QA3 .L28 no.716-718 Off-site
Request
George Mason
Fenwick stacks
QA3 .L28 no.718 Available Request
Georgetown
Lauinger stacks
QA3 .L28 no. 718 Available Request
Howard
Founders Library stacks
QA3 L28 NO. 718 Available Request
Other Authors Rackoff, Charles W., 1948-
Subjects Berechenbarkeit.
Calcul des prédicats.
Complexité de calcul (Informatique)
Complexité de calcul (informatique)
Computational complexity.
Komplexität.
Logica Matematica.
Matematica Da Computacao.
Mathematische Logik.
Prädikatenlogik.
Predicate calculus.
calcul prédicat.
complexité calcul.
méthodologie système déductif.
système logique.
théorie récursivité
Series Lecture notes in mathematics (Springer-Verlag) ; 718.
Description x, 243 pages : illustrations ; 24 cm.
Copyright Date 1979.
Notes Includes bibliographical references (pages 234-238) and index.
Network Numbers (OCoLC)5101638
(OCoLC)ocm05101638
WorldCat Search OCLC WorldCat
WorldCat Identities Ferrante, Jeanne, 1949-
Publication timeline, list of works, related names and subjects and other information

Services

Export citation to: RefWorks