Wyniki wyszukiwania:
wyszukanych pozycji: 8
 |
Mathematics of Program Construction: 7th International Conference, MPC 2004, Stirling, Scotland, Uk, July 12-14, 2004, Proceedings
ISBN: 9783540223801 / Angielski / Miękka / 2004 / 404 str. Termin realizacji zamówienia: ok. 22 dni roboczych (Bez gwarancji dostawy przed świętami) This book constitutes the refereed proceedings of the 7th International Conference on the Mathematics of 2004.The 19 revised full papers presented were carefully reviewed and selected from 37 submissions. Among the topics addressed are programming theory, programming methodology, program specification, program transformation, programming paradigms, programming calculi, and programming language semantics.
This book constitutes the refereed proceedings of the 7th International Conference on the Mathematics of 2004.The 19 revised full papers presented wer...
|
cena:
201,72 zł |
 |
Automata and Computability
ISBN: 9781461273097 / Angielski / Miękka / 2012 / 400 str. Termin realizacji zamówienia: ok. 22 dni roboczych (Bez gwarancji dostawy przed świętami) The aim of this textbook is to provide undergraduate students with an introduction to the basic theoretical models of computability, and to develop some of the model's rich and varied structure. Students who have already some experience with elementary discrete mathematics will find this a well-paced first course, and a number of supplementary chapters introduce more advanced concepts. The first part of the book is devoted to finite automata and their properties. Pushdown automata provide a broader class of models and enable the analysis of context-free languages. In the remaining chapters,...
The aim of this textbook is to provide undergraduate students with an introduction to the basic theoretical models of computability, and to develop so...
|
cena:
201,72 zł |
 |
Theory of Computation
ISBN: 9781849965712 / Angielski / Miękka / 2010 / 418 str. Termin realizacji zamówienia: ok. 22 dni roboczych (Bez gwarancji dostawy przed świętami) This textbook is uniquely written with dual purpose. It cover cores material in the foundations of computing for graduate students in computer science and also provides an introduction to some more advanced topics for those intending further study in the area. This innovative text focuses primarily on computational complexity theory: the classification of computational problems in terms of their inherent complexity. The book contains an invaluable collection of lectures for first-year graduates on the theory of computation. Topics and features include more than 40 lectures for first year... This textbook is uniquely written with dual purpose. It cover cores material in the foundations of computing for graduate students in computer scie... |
cena:
322,61 zł |
 |
Theory of Computation
ISBN: 9781846282973 / Angielski / Twarda / 2006 / 418 str. Termin realizacji zamówienia: ok. 22 dni roboczych (Bez gwarancji dostawy przed świętami) This textbook is uniquely written with dual purpose. It cover cores material in the foundations of computing for graduate students in computer science and also provides an introduction to some more advanced topics for those intending further study in the area. This innovative text focuses primarily on computational complexity theory: the classification of computational problems in terms of their inherent complexity. The book contains an invaluable collection of lectures for first-year graduates on the theory of computation. Topics and features include more than 40 lectures for first year... This textbook is uniquely written with dual purpose. It cover cores material in the foundations of computing for graduate students in computer scie... |
cena:
403,47 zł |
 |
The Design and Analysis of Algorithms
ISBN: 9781461287575 / Angielski / Miękka / 2011 / 322 str. Termin realizacji zamówienia: ok. 22 dni roboczych (Bez gwarancji dostawy przed świętami) These are my lecture notes from CS681: Design and Analysis of Algo rithms, a one-semester graduate course I taught at Cornell for three consec utive fall semesters from '88 to '90. The course serves a dual purpose: to cover core material in algorithms for graduate students in computer science preparing for their PhD qualifying exams, and to introduce theory students to some advanced topics in the design and analysis of algorithms. The material is thus a mixture of core and advanced topics. At first I meant these notes to supplement and not supplant a textbook, but over the three years they...
These are my lecture notes from CS681: Design and Analysis of Algo rithms, a one-semester graduate course I taught at Cornell for three consec utive f...
|
cena:
322,77 zł |
 |
Logic, Language, Information, and Computation: 31st International Workshop, Wollic 2025, Porto, Portugal, July 14-17, 2025, Proceedings
ISBN: 9783031995354 / Angielski Termin realizacji zamówienia: ok. 22 dni roboczych (Bez gwarancji dostawy przed świętami) |
cena:
266,28 zł |
 |
Automata and Computability
ISBN: 9780387949079 / Angielski / Twarda / 1997 / 400 str. Termin realizacji zamówienia: ok. 22 dni roboczych (Bez gwarancji dostawy przed świętami) The aim of this textbook is to provide undergraduate students with an introduction to the basic theoretical models of computability, and to develop some of the model's rich and varied structure. Students who have already some experience with elementary discrete mathematics will find this a well-paced first course, and a number of supplementary chapters introduce more advanced concepts. The first part of the book is devoted to finite automata and their properties. Pushdown automata provide a broader class of models and enable the analysis of context-free languages. In the remaining chapters,...
The aim of this textbook is to provide undergraduate students with an introduction to the basic theoretical models of computability, and to develop so...
|
cena:
302,60 zł |
 |
The Design and Analysis of Algorithms
ISBN: 9780387976877 / Angielski / Twarda / 1991 / 322 str. Termin realizacji zamówienia: ok. 22 dni roboczych (Bez gwarancji dostawy przed świętami) These are my lecture notes from CS681: Design and Analysis of Algo rithms, a one-semester graduate course I taught at Cornell for three consec utive fall semesters from '88 to '90. The course serves a dual purpose: to cover core material in algorithms for graduate students in computer science preparing for their PhD qualifying exams, and to introduce theory students to some advanced topics in the design and analysis of algorithms. The material is thus a mixture of core and advanced topics. At first I meant these notes to supplement and not supplant a textbook, but over the three years they...
These are my lecture notes from CS681: Design and Analysis of Algo rithms, a one-semester graduate course I taught at Cornell for three consec utive f...
|
cena:
403,47 zł |
Czytaj nas na:
KrainaKsiazek.PL - Księgarnia Internetowa
