Skip to content

Feasible Computations and Provable Complexity Properties
Stock Photo: Cover May Be Different

Feasible Computations and Provable Complexity Properties Paperback - 1987

by Juris Hartmanis


From the publisher

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, CSL, P, NP, PTAPE, EXPTIME, and EXPTAPE. Definitions and results are uniformly extended to computationally simpler natural families of languages such as NL, P, and CSL by using Log n-tape bounded reductions. The problem of determining what can and cannot be formally proven about running times of algorithms is discussed and related to the problem of establishing sharp time bounds for one-tape Turing machine computations, and the inability to formally prove running times for algorithms is then related to the presence of gaps in the hierarchy of complexity classes.

Details

  • Title Feasible Computations and Provable Complexity Properties
  • Author Juris Hartmanis
  • Binding Paperback
  • Edition First Edition
  • Pages 70
  • Volumes 1
  • Language ENG
  • Publisher Society for Industrial and Applied Mathematic, Philadelphia
  • Date January 1, 1987
  • ISBN 9780898710274 / 0898710278
  • Weight 0.28 lbs (0.13 kg)
  • Dimensions 8.98 x 5.98 x 0.31 in (22.81 x 15.19 x 0.79 cm)
Back to Top

More Copies for Sale

Feasible Computations and Provable Complexity Properties

Feasible Computations and Provable Complexity Properties

by Juris Hartmanis

  • Used
  • Paperback
Condition
Used - Very Good+
Binding
Paperback
ISBN 10 / ISBN 13
9780898710274 / 0898710278
Quantity Available
1
Seller
Moraga, California, United States
Seller rating:
This seller has earned a 5 of 5 Stars rating from Biblio customers.
Item Price
$19.00
FREE shipping to USA

Show Details

Description:
Philadelphia: Society for Industrial and Applied Mathematics, 1978. Softcover. Very Good+. 6 3/4 x 9 3/4. 1I Binding tight, spine uncreased. No marks. Minor wear to sunned covers.
Item Price
$19.00
FREE shipping to USA
FEASIBLE COMPUTATIONS AND PROVABLE COMPLEXITY PROPERTIES.
Stock Photo: Cover May Be Different

FEASIBLE COMPUTATIONS AND PROVABLE COMPLEXITY PROPERTIES.

by Hartmanis, Juris.

  • Used
  • Fine
  • Paperback
Condition
Used - Fine
Binding
Paperback
ISBN 10 / ISBN 13
9780898710274 / 0898710278
Quantity Available
1
Seller
North Reading, Massachusetts, United States
Seller rating:
This seller has earned a 5 of 5 Stars rating from Biblio customers.
Item Price
$25.00
$5.00 shipping to USA

Show Details

Description:
Society of Industrial and Applied Mathematics:, 1978. 62 pages. "The purpose of this monograph is to give an overview and a discussion of some recent results about computational complexity of feasible computations and the study of provable properties about complexity of computations." FINE SOFTCOVER.. Soft Cover. Fine. 4to - over 9¾" - 12" tall.
Item Price
$25.00
$5.00 shipping to USA