Idioma: Inglés
Publicado por Cambridge University Press, 2019
ISBN 10: 110841558X ISBN 13: 9781108415583
Librería: Books From California, Simi Valley, CA, Estados Unidos de America
EUR 115,87
Cantidad disponible: 1 disponibles
Añadir al carritohardcover. Condición: Good. Cover and edges may have some wear. Mild to Moderate creasing / bending to covers and pages.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 148,57
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Brand New. 243 pages. 9.25x6.25x0.75 inches. In Stock.
Idioma: Inglés
Publicado por Cambridge University Press, 2019
ISBN 10: 110841558X ISBN 13: 9781108415583
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
EUR 146,22
Cantidad disponible: Más de 20 disponibles
Añadir al carritoHardback. Condición: New. New copy - Usually dispatched within 4 working days. 518.
Idioma: Inglés
Publicado por Cambridge University Press, Cambridge, 2018
ISBN 10: 110841558X ISBN 13: 9781108415583
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America
EUR 166,37
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: new. Hardcover. This book presents and applies a framework for studying the complexity of algorithms. It is aimed at logicians, computer scientists, mathematicians and philosophers interested in the theory of computation and its foundations, and it is written at a level suitable for non-specialists. Part I provides an accessible introduction to abstract recursion theory and its connection with computability and complexity. This part is suitable for use as a textbook for an advanced undergraduate or graduate course: all the necessary elementary facts from logic, recursion theory, arithmetic and algebra are included. Part II develops and applies an extension of the homomorphism method due jointly to the author and Lou van den Dries for deriving lower complexity bounds for problems in number theory and algebra which (provably or plausibly) restrict all elementary algorithms from specified primitives. The book includes over 250 problems, from simple checks of the reader's understanding, to current open problems. The author presents and applies a new framework for studying the complexity of algorithms. The book is aimed at logicians, computer scientists, mathematicians and philosophers who are interested in the theory of computation and its foundations. It includes an accessible introduction to abstract recursion theory and contains over 250 problems. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Librería: moluna, Greven, Alemania
EUR 151,22
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New. The author presents and applies a new framework for studying the complexity of algorithms. The book is aimed at logicians, computer scientists, mathematicians and philosophers who are interested in the theory of computation and its foundations. It includes .
Librería: Revaluation Books, Exeter, Reino Unido
EUR 194,61
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Brand New. 243 pages. 9.25x6.25x0.75 inches. In Stock.
Idioma: Inglés
Publicado por Cambridge University Press Feb 2019, 2019
ISBN 10: 110841558X ISBN 13: 9781108415583
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 209,48
Cantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: Neu. Neuware - Presents a new framework for the complexity of algorithms, for all readers interested in the theory of computation.