topmenu
Wyniki wyszukiwania:
wyszukanych pozycji: 8
 |
Computational Molecular Biology: An Introduction
ISBN: 9780471872511 / Angielski / Twarda / 2000 / 300 str. Termin realizacji zamówienia: ok. 22 dni roboczych. Recently molecular biology has undergone unprecedented development generating vast quantities of data needing sophisticated computational methods for analysis, processing and archiving. This requirement has given birth to the truly interdisciplinary field of computational biology, or bioinformatics, a subject reliant on both theoretical and practical contributions from statistics, mathematics, computer science and biology.
* Provides the background mathematics required to understand why certain algorithms work * Guides the reader through probability theory, entropy and... Recently molecular biology has undergone unprecedented development generating vast quantities of data needing sophisticated computational methods for ...
|
cena:
1421,84 zł |
 |
Computational Molecular Biology: An Introduction
ISBN: 9780471872528 / Angielski / Miękka / 2000 / 300 str. Termin realizacji zamówienia: ok. 22 dni roboczych. Recently molecular biology has undergone unprecedented development generating vast quantities of data needing sophisticated computational methods for analysis, processing and archiving. This requirement has given birth to the truly interdisciplinary field of computational biology, or bioinformatics, a subject reliant on both theoretical and practical contributions from statistics, mathematics, computer science and biology.
* Provides the background mathematics required to understand why certain algorithms work * Guides the reader through probability theory, entropy and... Recently molecular biology has undergone unprecedented development generating vast quantities of data needing sophisticated computational methods for ...
|
cena:
475,61 zł |
 |
Arithmetic, Proof Theory, and Computational Complexity
ISBN: 9780198536901 / Angielski / Twarda / 1993 / 448 str. Termin realizacji zamówienia: ok. 30 dni roboczych. This book principally concerns the rapidly growing area of what might be termed "Logical Complexity Theory": the study of bounded arithmetic, propositional proof systems, length of proof, and similar themes, and the relations of these topics to computational complexity theory. Issuing from a two-year international collaboration, the book contains articles concerning the existence of the most general unifier, a special case of Kreisel's conjecture on length-of-proof, propositional logic proof size, a new alternating logtime algorithm for boolean formula evaluation and relation to branching...
This book principally concerns the rapidly growing area of what might be termed "Logical Complexity Theory": the study of bounded arithmetic, proposit...
|
cena:
444,55 zł |
 |
Computer Science Logic: 14th International Workshop, CSL 2000 Annual Conference of the Eacsl Fischbachau, Germany, August 21-26, 2000 Proceedi
ISBN: 9783540678953 / Angielski / Miękka / 2000 / 550 str. Termin realizacji zamówienia: ok. 20 dni roboczych. during the week-long CSL2000 meeting, was reserved for theGurevichSymposium, a special, one-day tribute to the scienti?c contributions of Professor Yuri Gurevich, at the occasion of his 60th birthday.
during the week-long CSL2000 meeting, was reserved for theGurevichSymposium, a special, one-day tribute to the scienti?c contributions of Professor Yu...
|
cena:
390,87 zł |
 |
Rna: Computational Methods for Structure, Kinetics, and Rational Design: Volume One
ISBN: 9781032496641 / Angielski / 30-12-2024 Książka dostępna od: 30-12-2024 |
|
Planowany termin premiery książki: 30-12-2024
Książkę można już zamówić z rabatem 5% |
|
374,50 zł |
 |
Boolean Functions and Computation Models
ISBN: 9783540594369 / Angielski / Twarda / 2002 / 602 str. Termin realizacji zamówienia: ok. 20 dni roboczych. The foundations of computational complexity theory go back to Alan Thring in the 1930s who was concerned with the existence of automatic procedures deciding the validity of mathematical statements. The first example of such a problem was the undecidability of the Halting Problem which is essentially the question of debugging a computer program: Will a given program eventu- ally halt? Computational complexity today addresses the quantitative aspects of the solutions obtained: Is the problem to be solved tractable? But how does one measure the intractability of computation? Several ideas were...
The foundations of computational complexity theory go back to Alan Thring in the 1930s who was concerned with the existence of automatic procedures de...
|
cena:
292,99 zł |
 |
Boolean Functions and Computation Models
ISBN: 9783642082177 / Angielski / Miękka / 2010 / 602 str. Termin realizacji zamówienia: ok. 20 dni roboczych. The foundations of computational complexity theory go back to Alan Thring in the 1930s who was concerned with the existence of automatic procedures deciding the validity of mathematical statements. The first example of such a problem was the undecidability of the Halting Problem which is essentially the question of debugging a computer program: Will a given program eventu- ally halt? Computational complexity today addresses the quantitative aspects of the solutions obtained: Is the problem to be solved tractable? But how does one measure the intractability of computation? Several ideas were...
The foundations of computational complexity theory go back to Alan Thring in the 1930s who was concerned with the existence of automatic procedures de...
|
cena:
292,99 zł |
 |
Feasible Mathematics II
ISBN: 9781461275824 / Angielski / Miękka / 2011 / 447 str. Termin realizacji zamówienia: ok. 20 dni roboczych. Perspicuity is part of proof. If the process by means of which I get a result were not surveyable, I might indeed make a note that this number is what comes out - but what fact is this supposed to confirm for me? I don't know 'what is supposed to come out' . . . . 1 -L. Wittgenstein A feasible computation uses small resources on an abstract computa- tion device, such as a 'lUring machine or boolean circuit. Feasible math- ematics concerns the study of feasible computations, using combinatorics and logic, as well as the study of feasibly presented mathematical structures such as groups,...
Perspicuity is part of proof. If the process by means of which I get a result were not surveyable, I might indeed make a note that this number is what...
|
cena:
195,42 zł |
Czytaj nas na:
Zobacz: Księgarnia Czeska | Wydawnictwo Książkowe Klimaty | Mapa strony | Lista autorów
KrainaKsiazek.PL - Księgarnia Internetowa
KrainaKsiazek.PL - Księgarnia Internetowa
