Tracked shipping to South Africa with premium packaging for just R199 

Ship to
South Africa
0

My Account

  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

menu

Select your country

Americas

Europe

Rest of the world

portada theory of semi-feasible algorithms
Type
Physical Book
Author
Publisher
Year
2010
Language
English
Pages
150
Format
Paperback
Dimensions
23.4x15.6x0.9 cm
Weight
0.23 kg.
ISBN
3642075819
ISBN13
9783642075810
Categories

theory of semi-feasible algorithms

Lane A. Hemaspaandra (Author) · Leen Torenvliet (Author) · Springer · Paperback

theory of semi-feasible algorithms - Hemaspaandra, Lane A. ; Torenvliet, Leen

Cheaper New Book Imported to South Africa
Delivery: 22 Oct - 04 Nov Shipping: 14 to 18 business days.
R 1,785
Faster New Book Imported to South Africa
Delivery: 09 Oct - 19 Oct Shipping: 5 to 6 business days.
R 2,422
R 1,785

Choose the list to add your product or create one New List

Go to My Wishlists
Calculate shipping cost

Synopsis "theory of semi-feasible algorithms"

An Invitation to the Dance It is an underappreciated fact that sets may have various types of complex- ity, and not all types are in harmony with each other. The primary goal of this book is to unify and make more widely accessible a vibrant stream of research-the theory of semi-feasible computation-that perfectly showcases the richness of, and contrasts between, the central types of complexity. The semi-feasible sets, which are most commonly referred to as the P- selective sets, are those sets L for which there is a deterministic polynornial- time algorithm that, when given as input any two strings of which at least one belongs to L, will output one of them that is in L. The reason we saythat the semi-feasible sets showcase the contrasts among types of complexity is that it is well-known that many semi-feasible sets have no recursive algorithms (thus their time complexitycannot be upper-bounded by standard time-complexity classes), yet all semi-feasible sets are simple in a wide range of other natural senses. In particular, the semi-feasible sets have small circuits, they are in the extended low hierarchy, and they cannot be NP-complete unless P = NP. The semi-feasible sets are fascinating for many reasons. First, as men- tioned above, they showcase the fact that mere deterministic time complex- ity is not the only potential type of complexity in the world of computation.

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

Is the book original?

All books in our catalog are Original.

In what language is the book written?

The book is written in English.

What is the format of this book?

The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews