{"title":"Lane A Hemaspaandra","description":null,"products":[{"product_id":"complexity-theory-companion-book-lane-a-hemaspaandra-9783540674191","title":"The Complexity Theory Companion","description":"The Complexity Theory Companion is an accessible, algorithmically oriented, research-centered, up-to-date guide to some of the most interesting techniques of complexity theory.   The book's thesis is that simple algorithms are at the heart of complexity theory. From the tree-pruning and interval-pruning algorithms that shape the first chapter to the query simulation procedures that dominate the last chapter, the central proof methods of the book are algorithmic. And to more clearly highlight the role of algorithmic techniques in complexity theory, the book is - unlike other texts on complexity - organized by technique rather than by topic. Each chapter of this book focuses on one technique: what it is, and what results and applications it yields.    This textbook was developed at the University of Rochester in courses given to graduate students and advanced undergraduates. Researchers also will find this book a valuable source of reference due to the comprehensive bibliography of close to five hundred entries, the thirty-five page subject index, and the appendices giving overviews of complexity classes and reductions.","brand":"WoB","offers":[{"title":"GB \/ VERY_GOOD \/ INTERNAL","offer_id":49532518465809,"sku":"GOR013494516","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"US \/ GOOD \/ SBYB","offer_id":50404299637009,"sku":"CIN3540674195G","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52128762429713,"sku":"NLS9783540674191","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/3540674195.jpg?v=1751189973"},{"product_id":"theory-of-semi-feasible-algorithms-book-lane-a-hemaspaandra-9783540422006","title":"Theory of Semi-Feasible Algorithms","description":"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.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52234128949521,"sku":"NLS9783540422006","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783540422006.jpg?v=1757802727"},{"product_id":"complexity-theory-retrospective-ii-book-lane-a-hemaspaandra-9780387949734","title":"Complexity Theory Retrospective II","description":"This volume provides a survey of the subject in the form of a collection of articles written by experts, that together provides a comprehensive guide to research. The editors'aim has been to provide an accessible description of the current stae of complexity theory, and to demonstrate the breadth of techniques and results that make this subject so exciting. Thus, papers run the gamut from sublogarithmic space to exponential time, and from new combinatorial techniques to interactive proof systems.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52425869558033,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52425870311697,"sku":"NLS9780387949734","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780387949734.jpg?v=1759156036"},{"product_id":"complexity-theory-retrospective-ii-book-lane-a-hemaspaandra-9781461273196","title":"Complexity Theory Retrospective II","description":"This volume provides a survey of the subject in the form of a collection of articles written by experts, that together provides a comprehensive guide to research. The editors'aim has been to provide an accessible description of the current stae of complexity theory, and to demonstrate the breadth of techniques and results that make this subject so exciting. Thus, papers run the gamut from sublogarithmic space to exponential time, and from new combinatorial techniques to interactive proof systems.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52453295161617,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52453295685905,"sku":"NLS9781461273196","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9781461273196.jpg?v=1759367452"},{"product_id":"complexity-theory-companion-book-lane-a-hemaspaandra-9783642086847","title":"The Complexity Theory Companion","description":"The Complexity Theory Companion is an accessible, algorithmically oriented, research-centered, up-to-date guide to some of the most interesting techniques of complexity theory.   The book's thesis is that simple algorithms are at the heart of complexity theory. From the tree-pruning and interval-pruning algorithms that shape the first chapter to the query simulation procedures that dominate the last chapter, the central proof methods of the book are algorithmic. And to more clearly highlight the role of algorithmic techniques in complexity theory, the book is - unlike other texts on complexity - organized by technique rather than by topic. Each chapter of this book focuses on one technique: what it is, and what results and applications it yields.    This textbook was developed at the University of Rochester in courses given to graduate students and advanced undergraduates. Researchers also will find this book a valuable source of reference due to the comprehensive bibliography of close to five hundred entries, the thirty-five page subject index, and the appendices giving overviews of complexity classes and reductions.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52475665056017,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52475666104593,"sku":"NLS9783642086847","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642086847.jpg?v=1759842884"},{"product_id":"theory-of-semi-feasible-algorithms-book-lane-a-hemaspaandra-9783642075810","title":"Theory of Semi-Feasible Algorithms","description":"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.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52480684065041,"sku":"NLS9783642075810","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642075810.jpg?v=1759850594"}],"url":"https:\/\/www.worldofbooks.com\/collections\/author-books-by-lane-a-hemaspaandra.oembed","provider":"World of Books ","version":"1.0","type":"link"}