wyszukanych pozycji: 4
Using Hard Problems to Create Pseudorandom Generators
ISBN: 9780262640527 / Angielski / Miękka / 2003 / 53 str. Termin realizacji zamówienia: ok. 13-18 dni roboczych (Dostawa przed świętami) Randomization is an important tool in the design of algorithms, and the ability of randomization to provide enhanced power is a major research topic in complexity theory. Noam Nisan continues the investigation into the power of randomization and the relationships between randomized and deterministic complexity classes by pursuing the idea of emulating randomness, or pseudorandom generation.Pseudorandom generators reduce the number of random bits required by randomized algorithms, enable the construction of certain cryptographic protocols, and shed light on the difficulty of simulating... Randomization is an important tool in the design of algorithms, and the ability of randomization to provide enhanced power is a major research topi... |
|
cena:
159,55 zł |
Algorithmic Game Theory
ISBN: 9780521872829 / Angielski / Twarda / 2007 / 778 str. Termin realizacji zamówienia: ok. 16-18 dni roboczych. In the last few years game theory has had a substantial impact on computer science, especially on Internet- and e-commerce-related issues. More than 40 of the top researchers in this field have written chapters that go from the foundations to the state of the art. Basic chapters on algorithmic methods for equilibria, mechanism design and combinatorial auctions are followed by chapters on incentives and pricing, cost sharing, information markets and cryptography and security. Students, researchers and practitioners alike need to learn more about these fascinating theoretical developments and...
In the last few years game theory has had a substantial impact on computer science, especially on Internet- and e-commerce-related issues. More than 4...
|
|
cena:
305,06 zł |
Communication Complexity
ISBN: 9780521029834 / Angielski / Miękka / 2006 / 208 str. Termin realizacji zamówienia: ok. 13-18 dni roboczych (Dostawa przed świętami) Communication Complexity surveys this mathematical theory, concentrating on the question of how much communication is necessary for any particular process. The first part of the book is devoted to the simple two-party model introduced by Yao in 1979, which is still the most widely studied model. The second part treats newer models developed to deal with more complicated communication processes. Finally, the authors treat applications of these models, including computer networks, VLSI circuits, and data structures.
Communication Complexity surveys this mathematical theory, concentrating on the question of how much communication is necessary for any particular pro...
|
|
cena:
291,73 zł |
Mathematical Logic through Python
ISBN: 9781108845076 / Angielski / Twarda / 2022 / 280 str. Termin realizacji zamówienia: ok. 16-18 dni roboczych. Using a unique pedagogical approach, this text introduces mathematical logic by guiding students in implementing the underlying logical concepts and mathematical proofs via Python programming. This approach, tailored to the unique intuitions and strengths of the ever-growing population of programming-savvy students, brings mathematical logic into the comfort zone of these students and provides clarity that can only be achieved by a deep hands-on understanding and the satisfaction of having created working code. While the approach is unique, the text follows the same set of topics typically...
Using a unique pedagogical approach, this text introduces mathematical logic by guiding students in implementing the underlying logical concepts and m...
|
|
cena:
305,06 zł |