DISCLOSURE:
When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission at no extra cost to you. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network, Amazon and Alibris.
ISBN10: 3540422005, ISBN13: 9783540422006, [publisher: Berlin Springer Verlag] Hardcover 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 [Darmstadt, Germany] [Publication Year: 2002]
ISBN10: 3540422005, ISBN13: 9783540422006, [publisher: Berlin Springer Verlag] Hardcover 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 [Darmstadt, Germany] [Publication Year: 2002]
ISBN10: 3540422005, ISBN13: 9783540422006, [publisher: Springer] Hardcover 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 Set ...
Berlin, Heidelberg Springer 2002 2003 ed. Hard cover New. Sewn binding. Cloth over boards. 150 p. Contains: Unspecified. Monographs in Theoretical Computer Science. an Eatcs.
ISBN10: 3540422005, ISBN13: 9783540422006, [publisher: Springer Berlin Heidelberg] Hardcover 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 typ ...
ISBN10: 3540422005, ISBN13: 9783540422006, [publisher: Springer Berlin Heidelberg] Hardcover 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 typ ...
Hard Cover. New. New Book; Fast Shipping from UK; Not signed; Not First Edition; The Theory of Semi-Feasible Algorithms. ISBN 3540422005 9783540422006 [GB]
Hardback. New. 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. ISBN 3540422005 9783540422006 [GB]
ISBN10: 3540422005, ISBN13: 9783540422006, [publisher: Springer] Hardcover First Edition First Edition thus. Theory of Semi-Feasible Algorithms by Lane A. Hemaspaandra; Leen Torenvliet. ISBN:9783540422006. Collectible item in excellent condition. [Deurne, Belgium] [Publication Year: 2002]
DISCLOSURE:
When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission at no extra cost to you. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network, Amazon and Alibris.
