Feasible computations and provable complexity properties (Record no. 182295)

MARC details
000 -LEADER
fixed length control field 00665nam a2200217Ia 4500
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 191130s1989##################000#0#eng##
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 519.4 HAR
100 ## - MAIN ENTRY--AUTHOR NAME
Personal name Hartmanis, Juris
245 ## - TITLE STATEMENT
Title Feasible computations and provable complexity properties
Statement of responsibility, etc Juris Hartmanis
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication Philadelphia, PA
Name of publisher Society for Industrial and Applied Mathematics
Year of publication 1989
300 ## - PHYSICAL DESCRIPTION
Number of Pages 62 p. ; 26 cm
500 ## - GENERAL NOTE
General note Bibliography: p. 61-62
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computational complexity
Topical Term Formal languages
Topical Term Machine theory
991 ## -
-- 254907
Holdings
Withdrawn status Lost status Damaged status Not for loan Home library Current library Date acquired Full call number Accession Number Price effective from Koha item type
        Anna Centenary Library Anna Centenary Library 13.10.2020 519.4 HAR 192924 13.10.2020 English Books

Find us on the map

Powered by Koha