Feasible Computations and Provable Complexity Properties by Juris Hartmanis

Feasible Computations and Provable Complexity Properties

Cbms-Nsf Regional Conference Series in Applied Mathematics

Juris Hartmanis

70 pages missing pub info (editions)

nonfiction computer science medium-paced
Powered by AI (Beta)
Loading...

Description

An overview of current developments in research on feasible computations; and a consideration of this area of research in relation to provable properties of complexity of computations. The author begins by defining and discussing efficient reducti...

Read more

Community Reviews

Loading...

Content Warnings

Loading...