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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
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.
For theoretical computer scientists, numerical analysts, and recursion theorists at a graduate or professional level, reviews the fundamental notions in complexity theory and discusses the various computational models for real continuous functions. Annotation copyright Book News, Inc. Portland, Or.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
EUR 12,21 für den Versand von Vereinigtes Königreich nach USA
Versandziele, Kosten & DauerGratis für den Versand innerhalb von/der USA
Versandziele, Kosten & DauerAnbieter: Phatpocket Limited, Waltham Abbey, HERTS, Vereinigtes Königreich
Zustand: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions. Bestandsnummer des Verkäufers Z1-U-017-02105
Anzahl: 1 verfügbar
Anbieter: Basi6 International, Irving, TX, USA
Zustand: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Bestandsnummer des Verkäufers ABEOCT25-122367
Anzahl: 1 verfügbar
Anbieter: Romtrade Corp., STERLING HEIGHTS, MI, USA
Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. Bestandsnummer des Verkäufers ABNR-83946
Anzahl: 1 verfügbar
Anbieter: ALLBOOKS1, Direk, SA, Australien
Brand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address. Bestandsnummer des Verkäufers SHAK122367
Anzahl: 1 verfügbar
Anbieter: Books Puddle, New York, NY, USA
Zustand: New. Bestandsnummer des Verkäufers 26970344
Anzahl: 1 verfügbar
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Zustand: New. Bestandsnummer des Verkäufers 7958967
Anzahl: 1 verfügbar
Anbieter: Antiquariat Renner OHG, Albstadt, Deutschland
Hardcover. Zustand: Sehr gut. Boston, Birkhäuser 1991. gr.8°. VII, 309 p. Hardbound. Progress in Theoretical Computer Science.- Name on flyleaf, otherwise like new. Bestandsnummer des Verkäufers 92203
Anzahl: 1 verfügbar
Anbieter: Fireside Bookshop, Stroud, GLOS, Vereinigtes Königreich
Cloth. Zustand: Very Good. Type: Book Small plain label inside cover. Bestandsnummer des Verkäufers 052912
Anzahl: 1 verfügbar
Anbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Zustand: New. Bestandsnummer des Verkäufers 18970338
Anzahl: 1 verfügbar
Anbieter: BennettBooksLtd, San Diego, NV, USA
Hardcover. Zustand: New. In shrink wrap. Looks like an interesting title! Bestandsnummer des Verkäufers Q-0817635866
Anzahl: 1 verfügbar