Items related to Theory of Semi-Feasible Algorithms
Synopsis
The primary goal of this book is unifying and making more widely accessible the vibrant stream of research - spanning more than two decades - on the theory of semi-feasible algorithms. In doing so it demonstrates the richness inherent in central notions of complexity: running time, nonuniform complexity, lowness, and NP-hardness. The book requires neither great mathematical maturity nor an extensive background in computational complexity theory or in computer science. Another aim of this book is to lay out a path along which the reader can quickly reach the frontiers of current research, and meet and engage the many exciting open problems in this area.
"synopsis" may belong to another edition of this title.
From the Back Cover
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.
Review
From the reviews:
"This book focuses mainly on the complexity of P-selective sets ... . a course from this text would require a highly-motivated instructor who can give the intuitive ideas leaving the details to the book. The book would also serve as a reasonable reference for those doing research in this area." (Lance Fortnow, SIGACT News, Vol. 35 (2), 2004)
"About this title" may belong to another edition of this title.
- PublisherSpringer
- Publication date2002
- ISBN 10 3540422005
- ISBN 13 9783540422006
- BindingHardcover
- Number of pages148
Buy New
Learn more about this copy
US$ 106.58
Shipping:
FREE
Within U.S.A.
Top Search Results from the AbeBooks Marketplace
Stock Image
Theory of Semi-Feasible Algorithms.
Seller: CSG Onlinebuch GMBH, Darmstadt, Germany
Seller rating 5 out of 5 stars
Gebunden. Condition: Gebraucht. 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 Englisch. Seller Inventory # 18183
Quantity: 1 available
Stock Image
Theory of Semi-Feasible Algorithms (EATCS Series: Monographs in Theoretical Computer Science)
Seller: killarneybooks, Inagh, CLARE, Ireland
Seller rating 5 out of 5 stars
Hardcover. Condition: Near Fine. Hardcover, x + 148 pages, NOT ex-library. Printed in Germany (not an economy / Indian edition). Clean and bright throughout with unmarked text, free of inscriptions and stamps, firmly bound. Boards show minor handling wear. Published without a dust jacket. -- 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. -- Contents: Introduction to Semi-Feasible Computation [P-Selectivity (Background and Definitions; Basic Properties); Nondeterministic Selectivity; Bibliographic Notes]; Advice [Advice Strings and Circuits; Advice for P-Selective Sets (Upper Bounds on the Amount of Advice for P-Selective Sets; Are There P-Selective Sets Other Than Standard Left Cuts?; Lower Bounds); Advice for Nondeterministically Selective Sets; Are There Unique Solutions for NP? (Small Circuits and the Polynomial Hierarchy; NP Lacks Unique Solutions Unless the Polynomial Hierarchy Collapses); Bibliographic Notes]; Lowness [Lowness Basics (Basic Lowness Theory; Extended Lowness and Refined Lowness); Lowness of P-Selective Sets (Upper Bounds; Lower Bounds); Lowness of Nondeterministically Selective Sets (Upper Bounds; Lower Bounds); Bibliographic Notes]; Hardness for Complexity Classes [Can P-Selective Sets Be Hard for Complexity Classes?; Can P-Selective Sets Be Truth-Table-Hard for UP, [delta]p2, PSPACE, or EXP?; Can P-Selective Sets Be Truth-Table-Hard or Turing-Hard for NP?; Can Nondeterministically Selective Sets Be NP-Hard or coNP-Hard?; Bibliographic Notes]; Closures [Connectives and Reductions; Boolean Closures; Reductions Under Which P-sel Is Closed Downward; Self-Reducible Sets and Selectivity; Reduction and Equivalence Classes (Equalities; Inequalities); Bibliographic Notes]; Generalizations and Related Notions [Generalizations of Selectivity (Weak Selectivity; Multiselectivity: The S(k) Hierarchy; Membership Comparable Sets; Probabilistic Selector Functions); P-Semi-Rankability: A Provable Refinement of P-Selectivity; Associative P-Selectivity: A Potential Refinement of P-Selectivity; Bibliographic Notes]; A. Definitions of Reductions and Complexity Classes, and Notation List [Reductions; Complexity Classes; Some Other Notation]; References; Index. Seller Inventory # 005156
Quantity: 1 available
Seller Image
Theory of Semi-Feasible Algorithms by Lane A. Hemaspaandra, Leen Torenvliet [Hardcover ]
Seller: booksXpress, Bayonne, NJ, U.S.A.
Seller rating 4 out of 5 stars
Hardcover. Condition: new. Seller Inventory # 9783540422006
Quantity: 10 available
Seller Image
Theory of Semi-Feasible Algorithms
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 1702905-n
Quantity: 5 available
Stock Image
Theory of Semi-Feasible Algorithms
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Mar3113020166952
Quantity: Over 20 available
Stock Image
Theory of Semi-Feasible Algorithms
Print on DemandSeller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Seller Inventory # ria9783540422006_lsuk
Quantity: Over 20 available
Seller Image
Theory of Semi-Feasible Algorithms
Published by
Springer Berlin Heidelberg Okt 2002, 2002
ISBN 10: 3540422005
ISBN 13: 9783540422006
New
Hardcover
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 164 pp. Englisch. Seller Inventory # 9783540422006
Quantity: 2 available
Seller Image
Theory of Semi-Feasible Algorithms
Seller: GreatBookPricesUK, Castle Donington, DERBY, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 1702905-n
Quantity: 5 available
Seller Image
Theory of Semi-Feasible Algorithms
Published by
Springer Berlin Heidelberg, 2002
ISBN 10: 3540422005
ISBN 13: 9783540422006
New
Hardcover
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Seller Inventory # 9783540422006
Quantity: 1 available
Seller Image
Theory of Semi-Feasible Algorithms
Published by
Springer Berlin Heidelberg, 2002
ISBN 10: 3540422005
ISBN 13: 9783540422006
New
Hardcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. A broad yet integrated study of Semi-Feasible AlgorithmsBrings the reader to the frontiers of current researchSelf-containedWith detailed derivation of resultsDoes not require difficult mathematicsCan be used in a course or for self-stud. Seller Inventory # 4889676
Quantity: Over 20 available