Image from Google Jackets

Feasible computations and provable complexity properties Juris Hartmanis

By: Publication details: Philadelphia, PA Society for Industrial and Applied Mathematics 1989Description: 62 p. ; 26 cmISSN:
  • 78014744
Subject(s): DDC classification:
  • 519.4 HAR
Item type: Books
Tags from this library: No tags from this library for this title.
Star ratings
    Average rating: 0.0 (0 votes)

Find us on the map

Powered by Koha