Normal view MARC view ISBD view

Feasible computations and provable complexity properties

Hartmanis, Juris

Feasible computations and provable complexity properties Juris Hartmanis - Philadelphia, PA Society for Industrial and Applied Mathematics 1989 - 62 p. ; 26 cm

Bibliography: p. 61-62

ISSN: 78014744

Subjects--Topical Terms:
Computational complexity
Formal languages
Machine theory

Dewey Class. No.: 519.4 HAR

Print
Save record
BIBTEX Dublin Core MARCXML MARC (non-Unicode/MARC-8) MARC (Unicode/UTF-8) MARC (Unicode/UTF-8, Standard) MODS (XML) RIS ISBD
More searches

Search for this title in:
Other Libraries (WorldCat) Other Databases (Google Scholar) Online Stores (Bookfinder.com) Open Library (openlibrary.org)

Feasible computations and provable complexity properties

Find us on the map