Hemaspaandra Lane (86 results)

Hardcover. Condition: Near Fine. hardback book in near fine condition.

Hardcover. Condition: new. New Copy. Customer Service Guaranteed.

Condition: New.

Hardback or Cased Book. Condition: New. Complexity Theory Retrospective II. Book.

Condition: New.

Condition: As New. Unread book in perfect condition.

Condition: good. Book is considered to be in good or better condition. The actual cover image may not match the stock photo. Hard cover books may show signs of wear on the spine, cover or dust jacket. Paperback book may show signs of wear on spine or cover as well as having a slight bend, curve or creasing to it. Book should have minimal to no writing inside and no highlighting. Pages should be free of tears or creasing. Stickers should not be present on cover or elsewhere, and any CD or DVD expected with the book is included. Book is not a former library copy.…

Condition: As New. Unread book in perfect condition.

Condition: New.

Hardcover. Condition: 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.".…

Condition: New.

Condition: New.

Condition: 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.…

Condition: As New. Unread book in perfect condition.

Condition: As New. Unread book in perfect condition.

Condition: New.

Condition: New. pp. 356.

Paperback. Condition: Brand New. 350 pages. 9.30x6.20x0.80 inches. In Stock.

Condition: New. pp. 356.

Condition: New.

Condition: New.

Condition: New. pp. 388.

Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume provides a comprehensive survey of the current state of research in complexity theory. It comprises a series of authoritative articles written by experts in their respective fields, and has been carefully edited to ensure a uniformity of notation and level of treatment. Researchers in computer science and mathematics will find much of interest here.…

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Readers of Complexity Theory Retrospective (published by Springer-Verlag in 1990) will remember that the collection consisted primarily of articles that first ap peared in preliminary form at one of the meetings of the Annual IEEE Conference on Structure in Complexity Theory. In particular, Complexity Theory Retrospective contained final versions of high-quality technical expository presentations, includ ing talks that honored Juris Hartmanis on the occasion of his sixtieth birthday. We began planning for the current collection some months before the scheduled meeting in 1994 of the Tenth Annual IEEE Conference on Structure in Complexity Theory. As with the original volume, several of the papers in this book originated as presentations at one of the meetings of the Structure in Complexity Theory con ference. We are pleased to provide this forum for final, polished versions of these papers. As it turns out, 1994 was a watershed year for the Structures conference, for at this meeting the conference attendees voted to change the conference name to its current name, the Annual IEEE Conference on Computational Complex ity. In voting to remove the expression 'Structure in,' the conferees recognized the recent explosion of techniques and results in computational complexity, and expressed concern that the original conference name might not accurately reflect the current status. We approached this volume in the same spirit.…

2002. 385 p. New! - Neu und originalverschweißt! 9783540674191 Sprache: Englisch Gewicht in Gramm: 703 Hardcover: 23.4 x 2.2 x 15.6 cm.

2002. 385 p. New! -- Neu und originalverschweißt! 9783540674191 Sprache: Englisch Gewicht in Gramm: 703 Hardcover: 23.4 x 2.2 x 15.6 cm.

Condition: New.

Taschenbuch. Condition: Neu. Complexity Theory Retrospective II | Lane A. Hemaspaandra (u. a.) | Taschenbuch | xi | Englisch | 2012 | Humana | EAN 9781461273196 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.…

Condition: New. pp. 388.

Gebunden. Condition: Sehr gut. Gebraucht - Sehr gut Zustand: Sehr gut, X, 148 p. 6 illus. About this book 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. Written for scientists and graduate students.…