Feasible Computations and Provable Complexity Problems

Feasible Computations and Provable Complexity Problems
$3.95 Shipping
List Price
19% Off
You Save

  • Condition: Good
  • Provider: Ergodebooks Contact
  • Provider Rating:
  • Ships From: Multiple Locations
  • Shipping: Standard
  • Comments: Buy with confidence. Excellent Customer Service & Return policy. Ships Fast. 24*7 Customer Service.

   30-day money back guarantee

Ask the provider about this item.

Most renters respond to questions in 48 hours or less.
The response will be emailed to you.
  • ISBN-13: 9780898710274
  • ISBN: 0898710278
  • Publisher: Society for Industrial and Applied Mathematics


Hartmanis, Juris


An overview of current developments in research on feasible computations. Defines and discusses efficient reductions between problems and considers the families and corresponding complete languages of NL, DCSL, CSL, P, NP, PTAPE, EXPTIME, and EXPTAPE.Hartmanis, Juris is the author of 'Feasible Computations and Provable Complexity Problems' with ISBN 9780898710274 and ISBN 0898710278.

[read more]

Questions about purchases?

You can find lots of answers to common customer questions in our FAQs

View a detailed breakdown of our shipping prices

Learn about our return policy

Still need help? Feel free to contact us

View college textbooks by subject
and top textbooks for college

The ValoreBooks Guarantee

The ValoreBooks Guarantee

With our dedicated customer support team, 30-day no-questions-asked return policy, and our price match guarantee, you can rest easy knowing that we're doing everything we can to save you time, money, and stress.