Da: HPB-Emerald, Dallas, TX, U.S.A.
hardcover. Condizione: Very Good. Connecting readers with great books since 1972! Used books may not include companion materials, and may have some shelf wear or limited writing. We ship orders daily and Customer Service is our top priority!
Hardcover. Condizione: As New. Like New, Light shelf wear.
Hardcover. Condizione: Near Fine. hardback book in near fine condition.
Da: GoldBooks, Denver, CO, U.S.A.
Condizione: new.
Da: Phatpocket Limited, Waltham Abbey, HERTS, Regno Unito
EUR 37,18
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: 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.
EUR 51,52
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
EUR 53,08
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
EUR 51,92
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: killarneybooks, Inagh, CLARE, Irlanda
EUR 25,20
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Near Fine. Hardcover, x + 148 pages, NOT ex-library. Clean and bright throughout with unmarked text, free of inscriptions and stamps, firmly bound. Boards show minor handling wear. Issued without a dust jacket. -- -- Theory of Semi-Feasible Algorithms is a comprehensive academic work within the field of theoretical computer science, focusing on the study of computational complexity, particularly the concept of semi-feasibility in algorithms. The book dives deeply into the properties and implications of semi-feasible sets, which are closely linked to selectivity in computational problems. It systematically analyses P-selective and nondeterministic selective sets, the role of advice in computational complexity, and the significance of lowness within complexity classes. The authors discuss P-selectivity as a measure of the ease with which membership in a set can be decided when given partial information, and how this concept extends to nondeterministic selectivity. The work explores the practical boundaries of these theoretical models, including advice strings, which provide additional information that can be used to solve problems, offering both upper and lower bounds for such advice in P-selective sets. Additionally, the book addresses key questions in complexity theory, such as whether P-selective sets can be hard for other complexity classes, like NP and PSPACE, or whether they can be truth-table or Turing-hard for these classes. An important component of the book is its investigation of the lowness properties of P-selective and nondeterministically selective sets, exploring how these sets can be placed within larger complexity hierarchies, such as the polynomial hierarchy, and their implications for computational power. The work also examines the closure properties of selectivity under various reductions and operations, including Boolean closures, self-reducibility, and equivalence classes, providing detailed insights into how these sets behave under specific computational transformations. Hemaspaandra and Torenvliet further generalize selectivity through weaker forms, such as multiselectivity and probabilistic selector functions, and introduce refinements to P-selectivity like P-semi-rankability and associative P-selectivity. These generalizations provide a more nuanced understanding of the relationship between selectivity and computational complexity. The monograph is aimed at researchers and students in theoretical computer science, particularly those interested in computational complexity theory, semi-feasibility, and algorithmic efficiency. It offers foundational concepts, advanced theorems, and rigorous proofs that contribute to the understanding of how semi-feasible algorithms fit into the broader landscape of computational complexity. -- "This book presents a consolidated survey of the vibrant field of research known as the theory of semi-feasible algorithms. This research stream perfectly showcases the richness of, and contrasts between, the central notions of complexity: running time, nonuniform complexity, lowness, and NP-hardness. Research into semi-feasible computation has already developed a rich set of tools, yet is young enough to have an abundance of fresh, open issues. Being essentially self-contained, the book requires neither great mathematical maturity nor an extensive background in computational complexity theory or in computer science in general. Newcomers are introduced to the field systematically and guided to the frontiers of current research. Researchers already active in the field will appreciate the book as a valuable source of reference.".
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
EUR 60,47
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 52,45
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
EUR 56,55
Quantità: 10 disponibili
Aggiungi al carrelloPF. Condizione: New.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 58,37
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
EUR 58,75
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: California Books, Miami, FL, U.S.A.
EUR 75,28
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
EUR 59,53
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Chiron Media, Wallingford, Regno Unito
EUR 62,79
Quantità: 10 disponibili
Aggiungi al carrelloPF. Condizione: New.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 64,64
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Condizione: New. pp. 356.
Condizione: New. pp. 356.
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New.
Lingua: Inglese
Editore: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 2001
ISBN 10: 3540674195 ISBN 13: 9783540674191
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Hardcover. Condizione: new. Hardcover. 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. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
EUR 83,25
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Roland Antiquariat UG haftungsbeschränkt, Weinheim, Germania
EUR 69,90
Quantità: 1 disponibili
Aggiungi al carrello2002. 385 p. New! - Neu und originalverschweißt! 9783540674191 Sprache: Englisch Gewicht in Gramm: 703 Hardcover: 23.4 x 2.2 x 15.6 cm.
Da: Roland Antiquariat UG haftungsbeschränkt, Weinheim, Germania
EUR 70,00
Quantità: 1 disponibili
Aggiungi al carrello2002. 385 p. New! -- Neu und originalverschweißt! 9783540674191 Sprache: Englisch Gewicht in Gramm: 703 Hardcover: 23.4 x 2.2 x 15.6 cm.
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. pp. 388.
EUR 77,61
Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 350 pages. 9.30x6.20x0.80 inches. In Stock.
Da: California Books, Miami, FL, U.S.A.
EUR 93,45
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: As New. Unread book in perfect condition.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 88,35
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.