# On the Computational Complexity of Algorithms

Credited to: Juris Hartmanis & Richard Stearns

Canonical: https://www.synapsebooks.app/catalog/on-the-computational-complexity-of-algorithms

Status: Discovery record. No guide is published.

## Focus

Supplied bibliography entry.

## The Library, Volume IV

Listed title: On the Computational Complexity of Algorithms

Listed credit: Juris Hartmanis & Richard Stearns

Publication details: Not supplied

Source shelf: 3. Theory & Algorithms

Source line: 230

Group: Papers

Difficulty: 3

No supplied note

Catalog metadata from the supplied bibliography. Edition and access verification pending.

## Find the original

Edition verification pending. [Search Open Library](https://openlibrary.org/search?title=On+the+Computational+Complexity+of+Algorithms&author=Juris+Hartmanis+%26+Richard+Stearns)

This discovery record is not a book summary. Named editorial approval of guide text remains pending.
