Artículos relacionados a Theory of Semi-Feasible Algorithms (Monographs in Theoretica...
Theory of Semi-Feasible Algorithms (Monographs in Theoretical Computer Science. An EATCS Series) - Tapa dura
Book by Lane A Hemaspaandra Leen Torenvliet
"Sinopsis" puede pertenecer a otra edición de este libro.
Críticas:
Reseña del editor:
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)
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
- EditorialSpringer
- Año de publicación2002
- ISBN 10 3540422005
- ISBN 13 9783540422006
- EncuadernaciónTapa dura
- Número de páginas164
Comprar nuevo
Ver este artículo
EUR 101,83
Gastos de envío:
GRATIS
A Estados Unidos de America
Los mejores resultados en AbeBooks
Imagen del vendedor
Theory of Semi-Feasible Algorithms by Lane A. Hemaspaandra, Leen Torenvliet [Hardcover ]
Publicado por
Springer
(2002)
ISBN 10: 3540422005
ISBN 13: 9783540422006
Nuevo
Tapa dura
Cantidad disponible: 10
Librería:
Valoración
Descripción Hardcover. Condición: new. Nº de ref. del artículo: 9783540422006
Comprar nuevo
EUR 101,83
Convertir moneda
Imagen de archivo
Theory of Semi-Feasible Algorithms
Publicado por
Springer
(2002)
ISBN 10: 3540422005
ISBN 13: 9783540422006
Nuevo
Tapa dura
Cantidad disponible: > 20
Librería:
Valoración
Descripción Condición: New. Nº de ref. del artículo: ABLIING23Mar3113020166952
Comprar nuevo
EUR 111,34
Convertir moneda
Imagen del vendedor
Theory of Semi-Feasible Algorithms
Publicado por
Springer
(2002)
ISBN 10: 3540422005
ISBN 13: 9783540422006
Nuevo
Tapa dura
Cantidad disponible: 5
Librería:
Valoración
Descripción Condición: New. Nº de ref. del artículo: 1702905-n
Comprar nuevo
EUR 112,63
Convertir moneda
Imagen de archivo
Theory of Semi-Feasible Algorithms
Publicado por
Springer
(2002)
ISBN 10: 3540422005
ISBN 13: 9783540422006
Nuevo
Tapa dura
Cantidad disponible: > 20
Librería:
Valoración
Descripción Condición: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Nº de ref. del artículo: ria9783540422006_lsuk
Comprar nuevo
EUR 114,55
Convertir moneda
Gastos de envío:
EUR 11,82
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Imagen del vendedor
Theory of Semi-Feasible Algorithms
Publicado por
Springer Berlin Heidelberg Okt 2002
(2002)
ISBN 10: 3540422005
ISBN 13: 9783540422006
Nuevo
Tapa dura
Cantidad disponible: 2
Librería:
Valoración
Descripción Buch. Condición: 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. Nº de ref. del artículo: 9783540422006
Comprar nuevo
EUR 106,99
Convertir moneda
Gastos de envío:
EUR 23,00
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Imagen del vendedor
Theory of Semi-Feasible Algorithms
Publicado por
Springer
(2002)
ISBN 10: 3540422005
ISBN 13: 9783540422006
Nuevo
Tapa dura
Cantidad disponible: 5
Librería:
Valoración
Descripción Condición: New. Nº de ref. del artículo: 1702905-n
Comprar nuevo
EUR 114,54
Convertir moneda
Gastos de envío:
EUR 17,75
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Imagen del vendedor
Theory of Semi-Feasible Algorithms
Publicado por
Springer Berlin Heidelberg
(2002)
ISBN 10: 3540422005
ISBN 13: 9783540422006
Nuevo
Tapa dura
Cantidad disponible: > 20
Librería:
Valoración
Descripción Condición: 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. Nº de ref. del artículo: 4889676
Comprar nuevo
EUR 92,27
Convertir moneda
Gastos de envío:
EUR 48,99
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Imagen del vendedor
Theory of Semi-Feasible Algorithms
Publicado por
Springer Berlin Heidelberg
(2002)
ISBN 10: 3540422005
ISBN 13: 9783540422006
Nuevo
Tapa dura
Cantidad disponible: 1
Librería:
Valoración
Descripción Buch. Condición: 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. Nº de ref. del artículo: 9783540422006
Comprar nuevo
EUR 109,42
Convertir moneda
Gastos de envío:
EUR 32,99
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Imagen de archivo
Theory of Semi-Feasible Algorithms
Publicado por
Springer
(2002)
ISBN 10: 3540422005
ISBN 13: 9783540422006
Nuevo
Tapa dura
Cantidad disponible: 15
Librería:
Valoración
Descripción Condición: New. 2002. 2003rd Edition. Hardcover. This text presents a consolidated survey of the vibrant field of research known as the theory of semi-feasible algorithms. This research stream showcases the richness of, and contrasts between, the central notions of complexity: running time, nonuniform complexity, lowness and NP-hardness. Series: Monographs in Theoretical Computer Science : An Eatcs Series. Num Pages: 160 pages, biography. BIC Classification: UMB. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 241 x 166 x 16. Weight in Grams: 380. Series: Monographs in Theoretical Computer Science : an Eatcs Series. 159 pages, 1, black & white illustrations. This text presents a consolidated survey of the vibrant field of research known as the theory of semi-feasible algorithms. This research stream showcases the richness of, and contrasts between, the central notions of complexity: running time, nonuniform complexity, lowness and NP-hardness. Cateogry: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. BIC Classification: UMB. Dimension: 241 x 166 x 16. Weight: 380. . . . . . Nº de ref. del artículo: V9783540422006
Comprar nuevo
EUR 142,09
Convertir moneda
Gastos de envío:
EUR 10,50
De Irlanda a Estados Unidos de America
Destinos, gastos y plazos de envío
Imagen de archivo
Theory of Semi-Feasible Algorithms
Publicado por
Springer
(2002)
ISBN 10: 3540422005
ISBN 13: 9783540422006
Nuevo
Tapa dura
Cantidad disponible: 15
Librería:
Valoración
Descripción Condición: New. 2002. 2003rd Edition. Hardcover. This text presents a consolidated survey of the vibrant field of research known as the theory of semi-feasible algorithms. This research stream showcases the richness of, and contrasts between, the central notions of complexity: running time, nonuniform complexity, lowness and NP-hardness. Series: Monographs in Theoretical Computer Science : An Eatcs Series. Num Pages: 160 pages, biography. BIC Classification: UMB. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 241 x 166 x 16. Weight in Grams: 380. Series: Monographs in Theoretical Computer Science : an Eatcs Series. 159 pages, 1, black & white illustrations. This text presents a consolidated survey of the vibrant field of research known as the theory of semi-feasible algorithms. This research stream showcases the richness of, and contrasts between, the central notions of complexity: running time, nonuniform complexity, lowness and NP-hardness. Cateogry: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. BIC Classification: UMB. Dimension: 241 x 166 x 16. Weight: 380. . . . . . Books ship from the US and Ireland. Nº de ref. del artículo: V9783540422006
Comprar nuevo
EUR 177,93
Convertir moneda