Skip to main content
PBS logo
 
 

Search - Feasible Computations and Provable Complexity Properties (CBMS-NSF Regional Conference Series in Applied Mathematics)

Feasible Computations and Provable Complexity Properties (CBMS-NSF Regional Conference Series in Applied Mathematics)
Feasible Computations and Provable Complexity Properties - CBMS-NSF Regional Conference Series in Applied Mathematics
Author: Juris Hartmanis
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 reductions between problems and considers the families and corresponding complete languages of NL, DCSL,...  more »
ISBN-13: 9780898710274
ISBN-10: 0898710278
Publication Date: 1/1/1987
Pages: 70
Rating:
  ?
0 stars, based on 0 rating
Publisher: Society for Industrial Mathematics
Book Type: Paperback
Members Wishing: 0
Reviews: Amazon | Write a Review



Back to the Top ↑
By using this Web site, you confirm that you have read, understood, and agreed to be bound by the Terms of Use. As an Amazon Associate we earn from qualifying purchases.
US Patent Number 7,877,315 | Copyright © 2004 - 2024 PaperBackSwap.com. All Rights Reserved.