0
*
0
*
1450
2025
book-filter
Work cover

Feasible computations and provable complexity properties

  • Juris Hartmanis

0

0 ratings

Genres

  • Computational complexity
  • Formal languages
  • Machine theory
Already read

people already read

Currently reading

people are currently reading

Want to read

people want to read

About the author

  • Juris Hartmanis

    1928 - 2022

    0

    0 ratings · 51 works

Editions

  • Edition cover

    Society for Industrial and Applied Mathematics

    1978

  • Edition cover

    Society for Industrialand Applied Mathematics

    1978