An edition of Feasible computations and provable complexity properties (1978)

Feasible computations and provable complexity properties

by

  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read
Feasible computations and provable complexity ...
J. Hartmanis
Not in Library

My Reading Lists:

Create a new list

Check-In

×Close
Add an optional check-in date. Check-in dates are used to track yearly reading goals.
Today
Notes
  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read
Notes

Buy this book

Last edited by WorkBot
December 15, 2009 | History
Edit
An edition of Feasible computations and provable complexity properties (1978)

Feasible computations and provable complexity properties

by

  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read

This edition doesn't have a description yet. Can you add one?

Publish Date
Publisher
Society for Industrial and Applied Mathematics
Language
English
Pages
62

Buy this book

Subjects
Computational complexity, Formal languages, Machine theory

Showing 1 featured edition. View all 1 editions?

Edition Availability
Cover of: Feasible computations and provable complexity properties
Feasible computations and provable complexity properties
1978, Society for Industrial and Applied Mathematics
in English
  • Not in Library

Add another edition?

Book Details

Edition Notes

Bibliography: p. 61-62.

Published in
Philadelphia
Series
Regional conference series in applied mathematics -- 30

Classifications

Dewey Decimal Class
519.4
Library of Congress
QA267 .H35

The Physical Object

Pagination
62 p. --
Number of pages
62

ID Numbers

Open Library
OL14794250M

Community Reviews (0)

Feedback?
No community reviews have been submitted for this work.

Lists

This work does not appear on any lists.

History

Download catalog record: RDF / JSON / OPDS | Wikipedia citation
December 15, 2009 Edited by WorkBot link works
September 14, 2008 Created by ImportBot Imported from University of Toronto MARC record