Von dem Buch Theory of Semi-Feasible Algorithms haben wir 3 gleiche oder sehr ähnliche Ausgaben identifiziert!
Falls Sie nur an einem bestimmten Exempar interessiert sind, können Sie aus der folgenden Liste jenes wählen, an dem Sie interessiert sind:
100%: Lane A. Hemaspaandra, Leen Torenvliet: Theory of Semi-Feasible Algorithms (ISBN: 9783662050804) 2013, Springer Berlin Heidelberg, 2003. Ausgabe, in Englisch, Taschenbuch.Nur diese Ausgabe anzeigen…
100%: Hemaspaandra, Lane A. and Torenvliet, Leen: Theory of Semi-Feasible Algorithms (Monographs in Theoretical Computer Science : an Eatcs Series) (ISBN: 9783642075810) in Deutsch, Taschenbuch.
Nur diese Ausgabe anzeigen…
Nur diese Ausgabe anzeigen…
75%: Torenvliet, Leen;Hemaspaandra, Lane A.: Theory of Semi-Feasible Algorithms (Monographs in Theoretical Computer Science. An EATCS Series) (Hardcover) (ISBN: 9783540422006) in Deutsch, Broschiert.Nur diese Ausgabe anzeigen…
Theory of Semi-Feasible Algorithms - 12 Angebote vergleichen
| Preise | Feb. 18 | Apr. 19 | Okt. 19 |
|---|---|---|---|
| Schnitt | Fr. 0.00 (€ 0.00)¹ | Fr. 100.00 (€ 102.29)¹ | Fr. 98.88 (€ 101.15)¹ |
| Nachfrage |
1
Theory of Semi-Feasible Algorithms
~EN NW EB DLISBN: 9783662050804 bzw. 3662050803, vermutlich in Englisch, Springer Shop, neu, E-Book, elektronischer Download.
Lieferung aus: Vereinigtes Königreich Grossbritannien und Nordirland, Lagernd, zzgl. Versandkosten.
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. eBook.
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. eBook.
2
Theory of Semi-Feasible Algorithms
~EN NW EB DLISBN: 9783662050804 bzw. 3662050803, vermutlich in Englisch, Springer Berlin Heidelberg, neu, E-Book, elektronischer Download.
Lieferung aus: Deutschland, Versandkostenfrei.
Theory of Semi-Feasible Algorithms: 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. Englisch, Ebook.
Theory of Semi-Feasible Algorithms: 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. Englisch, Ebook.
3
Theory of Semi-Feasible Algorithms
EN NW EB DLISBN: 9783662050804 bzw. 3662050803, in Englisch, neu, E-Book, elektronischer Download.
Lieferung aus: Vereinigte Staaten von Amerika, Lagernd, zzgl. Versandkosten.
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.
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.
4
Theory of Semi-Feasible Algorithms (Monographs in Theoretical Computer Science. An EATCS Series) (2013)
EN NW EB DLISBN: 9783662050804 bzw. 3662050803, in Englisch, 148 Seiten, 2003. Ausgabe, Springer, neu, E-Book, elektronischer Download.
Lieferung aus: Deutschland, E-Book zum Download, Versandkostenfrei.
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. Kindle Edition, Ausgabe: 2003, Format: Kindle eBook, Label: Springer, Springer, Produktgruppe: eBooks, Publiziert: 2013-04-17, Freigegeben: 2013-04-17, Studio: Springer.
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. Kindle Edition, Ausgabe: 2003, Format: Kindle eBook, Label: Springer, Springer, Produktgruppe: eBooks, Publiziert: 2013-04-17, Freigegeben: 2013-04-17, Studio: Springer.
6
Theory of Semi-Feasible Algorithms (2010)
DE PB NW RPISBN: 9783642075810 bzw. 3642075819, in Deutsch, Springer Dez 2010, Taschenbuch, neu, Nachdruck.
Von Händler/Antiquariat, AHA-BUCH GmbH [51283250], Einbeck, Germany.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
7
Theory of Semi-Feasible Algorithms (Monographs in Theoretical Computer Science. An EATCS Series)
DE PB NWISBN: 9783642075810 bzw. 3642075819, in Deutsch, Springer, Berlin/Heidelberg/New York, NY, Deutschland, Taschenbuch, neu.
Von Händler/Antiquariat, BuySomeBooks [52360437], Las Vegas, NV, U.S.A.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
9
Theory of Semi-Feasible Algorithms (Monographs in Theoretical Computer Science. An EATCS Series) (2003)
DE PB NWISBN: 9783642075810 bzw. 3642075819, in Deutsch, Springer Berlin Heidelberg, Taschenbuch, neu.
Von Händler/Antiquariat, Revaluation Books [2134736], Exeter, United Kingdom.
158 pages. In Stock.
158 pages. In Stock.
Lade…