Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 52,08
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
EUR 62,81
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New. pp. 447 1st Edition, Reprint.
EUR 60,14
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New. pp. 447.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 58,40
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
EUR 62,57
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New. pp. 447.
EUR 75,69
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 460.
EUR 70,80
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: New. 2011. Paperback. . . . . .
EUR 85,72
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: New. 2011. Paperback. . . . . . Books ship from the US and Ireland.
Librería: Anis Press, Walnut Creek, CA, Estados Unidos de America
EUR 87,24
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover Dec 20, 1993. Condición: New.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 101,06
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 101,47
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 99,85
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 100,23
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Chiron Media, Wallingford, Reino Unido
EUR 99,92
Cantidad disponible: 10 disponibles
Añadir al carritoPaperback. Condición: New.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 99,49
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Like New. Like New. book.
EUR 59,97
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Perspicuity is part of proof. If the process by means of which I get a result were not surveyable, I might indeed make a note that this number is what comes out - but what fact is this supposed to confirm for me I don't know 'what is supposed to come out' . . . . 1 -L. Wittgenstein A feasible computation uses small resources on an abstract computa tion device, such as a 'lUring machine or boolean circuit. Feasible math ematics concerns the study of feasible computations, using combinatorics and logic, as well as the study of feasibly presented mathematical structures such as groups, algebras, and so on. This volume contains contributions to feasible mathematics in three areas: computational complexity theory, proof theory and algebra, with substantial overlap between different fields. In computational complexity theory, the polynomial time hierarchy is characterized without the introduction of runtime bounds by the closure of certain initial functions under safe composition, predicative recursion on notation, and unbounded minimization (S. Bellantoni); an alternative way of looking at NP problems is introduced which focuses on which pa rameters of the problem are the cause of its computational complexity and completeness, density and separation/collapse results are given for a struc ture theory for parametrized problems (R. Downey and M. Fellows); new characterizations of PTIME and LINEAR SPACE are given using predicative recurrence over all finite tiers of certain stratified free algebras (D.
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 124,99
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 124,99
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
EUR 97,13
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Librería: Basi6 International, Irving, TX, Estados Unidos de America
EUR 136,17
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
Librería: Romtrade Corp., STERLING HEIGHTS, MI, Estados Unidos de America
EUR 136,17
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: 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.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 137,36
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 290.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 139,83
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 304 Softcover reprint of the original 1st ed. 2015 edition NO-PA16APR2015-KAP.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 156,01
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 149,59
Cantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: Brand New. reprint edition. 304 pages. 9.25x6.10x0.69 inches. In Stock.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 151,59
Cantidad disponible: 2 disponibles
Añadir al carritoHardcover. Condición: Brand New. 304 pages. French language. 9.25x6.25x0.75 inches. In Stock.
Librería: Buchpark, Trebbin, Alemania
EUR 59,87
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: Sehr gut. Zustand: Sehr gut | Seiten: 304 | Sprache: Englisch | Produktart: Bücher | This monograph provides a self-contained introduction to symmetric functions and their use in enumerative combinatorics. It is the first book to explore many of the methods and results that the authors present. Numerous exercises are included throughout, along with full solutions, to illustrate concepts and also highlight many interesting mathematical ideas.The text begins by introducing fundamental combinatorial objects such as permutations and integer partitions, as well as generating functions. Symmetric functions are considered in the next chapter, with a unique emphasis on the combinatorics of the transition matrices between bases of symmetric functions. Chapter 3 uses this introductory material to describe how to find an assortment of generating functions for permutation statistics, and then these techniques are extended to find generating functions for a variety of objects in Chapter 4. The next two chapters present the Robinson-Schensted-Knuthalgorithm and a method for proving Pólyäs enumeration theorem using symmetric functions. Chapters 7 and 8 are more specialized than the preceding ones, covering consecutive pattern matches in permutations, words, cycles, and alternating permutations and introducing the reciprocity method as a way to define ring homomorphisms with desirable properties.Counting with Symmetric Functions will appeal to graduate students and researchers in mathematics or related subjects who are interested in counting methods, generating functions, or symmetric functions. The unique approach taken and results and exercises explored by the authors make it an important contribution to the mathematical literature.
Idioma: Inglés
Publicado por Springer International Publishing, Springer International Publishing, 2019
ISBN 10: 3319795104 ISBN 13: 9783319795102
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 106,99
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - This monograph provides a self-contained introduction to symmetric functions and their use in enumerative combinatorics. It is the first book to explore many of the methods and results that the authors present. Numerous exercises are included throughout, along with full solutions, to illustrate concepts and also highlight many interesting mathematical ideas.The text begins by introducing fundamental combinatorial objects such as permutations and integer partitions, as well as generating functions. Symmetric functions are considered in the next chapter, with a unique emphasis on the combinatorics of the transition matrices between bases of symmetric functions. Chapter 3 uses this introductory material to describe how to find an assortment of generating functions for permutation statistics, and then these techniques are extended to find generating functions for a variety of objects in Chapter 4. The next two chapters present the Robinson-Schensted-Knuthalgorithm and a method for proving Pólya's enumeration theorem using symmetric functions. Chapters 7 and 8 are more specialized than the preceding ones, covering consecutive pattern matches in permutations, words, cycles, and alternating permutations and introducing the reciprocity method as a way to define ring homomorphisms with desirable properties.Counting with Symmetric Functions will appeal to graduate students and researchers in mathematics or related subjects who are interested in counting methods, generating functions, or symmetric functions. The unique approach taken and results and exercises explored by the authors make it an important contribution to the mathematical literature.
Idioma: Inglés
Publicado por Springer International Publishing, 2015
ISBN 10: 3319236172 ISBN 13: 9783319236179
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 106,99
Cantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - This monograph provides a self-contained introduction to symmetric functions and their use in enumerative combinatorics. It is the first book to explore many of the methods and results that the authors present. Numerous exercises are included throughout, along with full solutions, to illustrate concepts and also highlight many interesting mathematical ideas.The text begins by introducing fundamental combinatorial objects such as permutations and integer partitions, as well as generating functions. Symmetric functions are considered in the next chapter, with a unique emphasis on the combinatorics of the transition matrices between bases of symmetric functions. Chapter 3 uses this introductory material to describe how to find an assortment of generating functions for permutation statistics, and then these techniques are extended to find generating functions for a variety of objects in Chapter 4. The next two chapters present the Robinson-Schensted-Knuthalgorithm and a method for proving Pólya's enumeration theorem using symmetric functions. Chapters 7 and 8 are more specialized than the preceding ones, covering consecutive pattern matches in permutations, words, cycles, and alternating permutations and introducing the reciprocity method as a way to define ring homomorphisms with desirable properties.Counting with Symmetric Functions will appeal to graduate students and researchers in mathematics or related subjects who are interested in counting methods, generating functions, or symmetric functions. The unique approach taken and results and exercises explored by the authors make it an important contribution to the mathematical literature.
Idioma: Inglés
Publicado por Springer International Publishing, Springer International Publishing Mär 2019, 2019
ISBN 10: 3319795104 ISBN 13: 9783319795102
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 106,99
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Neuware -This monograph provides a self-contained introduction to symmetric functions and their use in enumerative combinatorics. It is the first book to explore many of the methods and results that the authors present. Numerous exercises are included throughout, along with full solutions, to illustrate concepts and also highlight many interesting mathematical ideas.The text begins by introducing fundamental combinatorial objects such as permutations and integer partitions, as well as generating functions. Symmetric functions are considered in the next chapter, with a unique emphasis on the combinatorics of the transition matrices between bases of symmetric functions. Chapter 3 uses this introductory material to describe how to find an assortment of generating functions for permutation statistics, and then these techniques are extended to find generating functions for a variety of objects in Chapter 4. The next two chapters present the Robinson-Schensted-Knuthalgorithm and a method for proving Pólyäs enumeration theorem using symmetric functions. Chapters 7 and 8 are more specialized than the preceding ones, covering consecutive pattern matches in permutations, words, cycles, and alternating permutations and introducing the reciprocity method as a way to define ring homomorphisms with desirable properties.Counting with Symmetric Functions will appeal to graduate students and researchers in mathematics or related subjects who are interested in counting methods, generating functions, or symmetric functions. The unique approach taken and results and exercises explored by the authors make it an important contribution to the mathematical literature.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 304 pp. Englisch.