Published by Berlin Springer Verlag, 2002
ISBN 10: 3540422005 ISBN 13: 9783540422006
Seller: CSG Onlinebuch GMBH, Darmstadt, Germany
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.
Published by Springer, 2003
ISBN 10: 3540422005 ISBN 13: 9783540422006
Seller: killarneybooks, Inagh, CLARE, Ireland
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.
Published by Springer, 2002
ISBN 10: 3540422005 ISBN 13: 9783540422006
Seller: booksXpress, Bayonne, NJ, U.S.A.
Hardcover. Condition: new.
Published by Springer, 2010
ISBN 10: 3642075819 ISBN 13: 9783642075810
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New.
Published by Springer, 2002
ISBN 10: 3540422005 ISBN 13: 9783540422006
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New.
Published by Springer, 2002
ISBN 10: 3540422005 ISBN 13: 9783540422006
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New.
Published by Springer, 2010
ISBN 10: 3642075819 ISBN 13: 9783642075810
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book.
Published by Springer, 2002
ISBN 10: 3540422005 ISBN 13: 9783540422006
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book.
Published by Springer, 2002
ISBN 10: 3540422005 ISBN 13: 9783540422006
Seller: GreatBookPricesUK, Castle Donington, DERBY, United Kingdom
Condition: New.
Published by Springer, 2010
ISBN 10: 3642075819 ISBN 13: 9783642075810
Seller: booksXpress, Bayonne, NJ, U.S.A.
Soft Cover. Condition: new.
Published by Springer Berlin Heidelberg, 2010
ISBN 10: 3642075819 ISBN 13: 9783642075810
Seller: moluna, Greven, Germany
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.
Published by Springer Berlin Heidelberg, 2002
ISBN 10: 3540422005 ISBN 13: 9783540422006
Seller: moluna, Greven, Germany
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.
Published by Springer, 2002
ISBN 10: 3540422005 ISBN 13: 9783540422006
Seller: BennettBooksLtd, North Las Vegas, NV, U.S.A.
hardcover. Condition: New. In shrink wrap. Looks like an interesting title!.
Published by Springer, 2002
ISBN 10: 3540422005 ISBN 13: 9783540422006
Seller: BennettBooksLtd, North Las Vegas, NV, U.S.A.
hardcover. Condition: New. In shrink wrap. Looks like an interesting title!.
Published by Springer, 2002
ISBN 10: 3540422005 ISBN 13: 9783540422006
Seller: GreatBookPricesUK, Castle Donington, DERBY, United Kingdom
Condition: As New. Unread book in perfect condition.
Published by Springer, 2010
ISBN 10: 3642075819 ISBN 13: 9783642075810
Seller: Mispah books, Redhill, SURRE, United Kingdom
Paperback. Condition: Like New. Like New. book.
Published by Springer, 2002
ISBN 10: 3540422005 ISBN 13: 9783540422006
Seller: Mispah books, Redhill, SURRE, United Kingdom
Hardcover. Condition: Like New. Like New. book.
Published by Springer, 2002
ISBN 10: 3540422005 ISBN 13: 9783540422006
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition.