1929 Calculi 1999 - 5 Angebote vergleichen
Bester Preis: € 134,75 (vom 15.05.2017)1
Polynomial Time Calculi (2009)
EN PB NWISBN: 9781409273134 bzw. 140927313X, in Englisch, 286 Seiten, lulu.com, Taschenbuch, neu.
Lieferung aus: Vereinigte Staaten von Amerika, Usually ships in 24 hours.
Von Händler/Antiquariat, Amazon.com.
This thesis is about type systems which guarantee polynomial time complexity of typed programs. A type system is a tool to give a computer program an additional structure which makes sure that it satisfies certain properties. In this work type systems are introduced and mathematically analysed, which type only those algorithms which terminate after polynomially many execution steps in the size of the input. Polynomial time is an important complexity class for practical application because polynomial algorithms grow reasonable fast to be feasibly computable also for bigger inputs. Paperback, Label: lulu.com, lulu.com, Product group: Book, Published: 2009-03-19, Studio: lulu.com.
Von Händler/Antiquariat, Amazon.com.
This thesis is about type systems which guarantee polynomial time complexity of typed programs. A type system is a tool to give a computer program an additional structure which makes sure that it satisfies certain properties. In this work type systems are introduced and mathematically analysed, which type only those algorithms which terminate after polynomially many execution steps in the size of the input. Polynomial time is an important complexity class for practical application because polynomial algorithms grow reasonable fast to be feasibly computable also for bigger inputs. Paperback, Label: lulu.com, lulu.com, Product group: Book, Published: 2009-03-19, Studio: lulu.com.
2
Polynomial Time Calculi (2009)
EN PB USISBN: 9781409273134 bzw. 140927313X, in Englisch, 286 Seiten, lulu.com, Taschenbuch, gebraucht.
Lieferung aus: Vereinigte Staaten von Amerika, Usually ships in 1-2 business days.
Von Händler/Antiquariat, Red Rhino.
This thesis is about type systems which guarantee polynomial time complexity of typed programs. A type system is a tool to give a computer program an additional structure which makes sure that it satisfies certain properties. In this work type systems are introduced and mathematically analysed, which type only those algorithms which terminate after polynomially many execution steps in the size of the input. Polynomial time is an important complexity class for practical application because polynomial algorithms grow reasonable fast to be feasibly computable also for bigger inputs. Paperback, Label: lulu.com, lulu.com, Product group: Book, Published: 2009-03-19, Studio: lulu.com.
Von Händler/Antiquariat, Red Rhino.
This thesis is about type systems which guarantee polynomial time complexity of typed programs. A type system is a tool to give a computer program an additional structure which makes sure that it satisfies certain properties. In this work type systems are introduced and mathematically analysed, which type only those algorithms which terminate after polynomially many execution steps in the size of the input. Polynomial time is an important complexity class for practical application because polynomial algorithms grow reasonable fast to be feasibly computable also for bigger inputs. Paperback, Label: lulu.com, lulu.com, Product group: Book, Published: 2009-03-19, Studio: lulu.com.
5
1929 Calculi 1999 (1999)
DE PB USISBN: 9788070370841 bzw. 807037084X, in Deutsch, National Technical Museum, Taschenbuch, gebraucht.
Lieferung aus: Deutschland, Versandfertig in 1 - 2 Werktagen, plus poštovné (ak dodaný).
Von Händler/Antiquariat, Smaller World Future DE.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Von Händler/Antiquariat, Smaller World Future DE.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Lade…