Monographs in Theoretical Computer Science. An EATCS Series

Theory of Semi-Feasible Algorithms

Authors: Hemaspaandra, Lane, Torenvliet, Leen

Buy this book

eBook 95,19 €
price for Spain (gross)
  • ISBN 978-3-662-05080-4
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover 119,59 €
price for Spain (gross)
  • ISBN 978-3-540-42200-6
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
Softcover 119,59 €
price for Spain (gross)
  • ISBN 978-3-642-07581-0
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
About this book

This book presents a consolidated survey of the vibrant field of research known as the theory of semi-feasible algorithms. This research stream perfectly showcases the richness of, and contrasts between, the central notions of complexity: running time, nonuniform complexity, lowness, and NP-hardness. Research into semi-feasible computation has already developed a rich set of tools, yet is young enough to have an abundance of fresh, open issues.

Being essentially self-contained, the book requires neither great mathematical maturity nor an extensive background in computational complexity theory or in computer science in general. Newcomers are introduced to the field systematically and guided to the frontiers of current research. Researchers already active in the field will appreciate the book as a valuable source of reference.

Reviews

From the reviews:

"This book focuses mainly on the complexity of P-selective sets … . a course from this text would require a highly-motivated instructor who can give the intuitive ideas leaving the details to the book. The book would also serve as a reasonable reference for those doing research in this area." (Lance Fortnow, SIGACT News, Vol. 35 (2), 2004)


Table of contents (6 chapters)

  • Introduction to Semi-Feasible Computation

    Hemaspaandra, Lane A. (et al.)

    Pages 1-16

    Preview Buy Chapter 30,19 €
  • Advice

    Hemaspaandra, Lane A. (et al.)

    Pages 17-40

    Preview Buy Chapter 30,19 €
  • Lowness

    Hemaspaandra, Lane A. (et al.)

    Pages 41-59

    Preview Buy Chapter 30,19 €
  • Hardness for Complexity Classes

    Hemaspaandra, Lane A. (et al.)

    Pages 61-78

    Preview Buy Chapter 30,19 €
  • Closures

    Hemaspaandra, Lane A. (et al.)

    Pages 79-103

    Preview Buy Chapter 30,19 €

Buy this book

eBook 95,19 €
price for Spain (gross)
  • ISBN 978-3-662-05080-4
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover 119,59 €
price for Spain (gross)
  • ISBN 978-3-540-42200-6
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
Softcover 119,59 €
price for Spain (gross)
  • ISBN 978-3-642-07581-0
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Theory of Semi-Feasible Algorithms
Authors
Series Title
Monographs in Theoretical Computer Science. An EATCS Series
Copyright
2003
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-662-05080-4
DOI
10.1007/978-3-662-05080-4
Hardcover ISBN
978-3-540-42200-6
Softcover ISBN
978-3-642-07581-0
Series ISSN
1431-2654
Edition Number
1
Number of Pages
X, 150
Topics