| 書目名稱 | Random Generation of Trees | | 副標(biāo)題 | Random Generators in | | 編輯 | Laurent Alonso,René Schott | | 視頻video | http://file.papertrans.cn/822/821051/821051.mp4 | | 圖書封面 |  | | 描述 | .Random Generation of Trees. is about a field on thecrossroads between computer science, combinatorics and probabilitytheory. Computer scientists need random generators for performanceanalysis, simulation, image synthesis, etc. In this context randomgeneration of trees is of particular interest. The algorithmspresented here are efficient and easy to code. Some aspects ofHorton--Strahler numbers, programs written in C and pictures arepresented in the appendices. The complexity analysis is donerigorously both in the worst and average cases. ..Random Generation of Trees. is intended for students in computerscience and applied mathematics as well as researchers interested inrandom generation. . | | 出版日期 | Book 1995 | | 關(guān)鍵詞 | Notation; Probability theory; algorithms; code; combinatorics; complexity | | 版次 | 1 | | doi | https://doi.org/10.1007/978-1-4757-6353-9 | | isbn_softcover | 978-1-4419-5150-2 | | isbn_ebook | 978-1-4757-6353-9 | | copyright | Springer-Verlag US 1995 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-10 00:04
發(fā)表于 2025-3-21 17:58:39
