Starting with Cook's pioneering work on NP-completeness in 1970, polynomial complexity theory, the study of polynomial-time com� putability, has quickly emerged as the new foundation of algorithms. On the one hand, it bridges the gap between the abstract approach of recursive function theory and the concrete approach of analysis of algorithms. It extends the notions and tools of the theory of computability to provide a solid theoretical foundation for the study of computational complexity of practical problems. In addition, the theoretical studies of the notion of polynomial-time tractability some� times also yield interesting new practical algorithms. A typical exam� ple is the application of the ellipsoid algorithm to combinatorial op� timization problems (see, for example, Lovasz [1986]). On the other hand, it has a strong influence on many different branches of mathe� matics, including combinatorial optimization, graph theory, number theory and cryptography. As a consequence, many researchers have begun to re-examine various branches of classical mathematics from the complexity point of view. For a given nonconstructive existence theorem in classical mathematics, one would like to find a construc� tive proof which admits a polynomial-time algorithm for the solution. One of the examples is the recent work on algorithmic theory of per� mutation groups. In the area of numerical computation, there are also two tradi� tionally independent approaches: recursive analysis and numerical analysis.

"About this title" may belong to another edition of this title.

Store Description

We sell textbooks to students at very affordable prices. All books are brand new, satisfaction guaranteed.

Visit Seller's Storefront

Seller's business information

Romtrade Corp.
39137 BYERS DR., STERLING HEIGHTS, MI, 48310, U.S.A.

Sale & Shipping Terms

Terms of Sale

We guarantee the condition of every book as it's described on the Abebooks web
sites. If you're dissatisfied with your purchase (Incorrect Book/Not as
Described/Damaged) or if the order hasn't arrived, you're eligible for a refund
within 30 days of the estimated delivery date. If you've changed your mind about
a book that you've ordered, please use the Ask bookseller a question link to
contact us and we'll respond within 2 business days. The contact persons name is
Constantin Marandici and the m...

More Information

Shipping Terms

Orders usually ship within 2 business days. Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required. We use USPS, DHL and ARAMEX for shipping.

Shipping rates within U.S.A.

Shipping rates within U.S.A.
Order quantity	5 to 10 business days	3 to 6 business days
First item	US$ 0.00	US$ 0.00

Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.