Iskusstvo programmirovanija. Tom 4A. and 50 similar items
Iskusstvo programmirovanija. Tom 4A. Kombinatornye algoritmy. Chast 1
$138.00
View full item details »
Shipping options
Offer policy
OBO - Seller accepts offers on this item.
Details
Return policy
Refunds available: See booth/item description for details
Purchase protection
Payment options
PayPal accepted
PayPal Credit accepted
Venmo accepted
PayPal, MasterCard, Visa, Discover, and American Express accepted
Maestro accepted
Amazon Pay accepted
Nuvei accepted
View full item details »
Shipping options
Offer policy
OBO - Seller accepts offers on this item.
Details
Return policy
Refunds available: See booth/item description for details
Purchase protection
Payment options
PayPal accepted
PayPal Credit accepted
Venmo accepted
PayPal, MasterCard, Visa, Discover, and American Express accepted
Maestro accepted
Amazon Pay accepted
Nuvei accepted
Item traits
Category: | |
---|---|
Quantity Available: |
10 in stock |
Condition: |
New |
Publisher: |
Viljams |
Authors: |
Knut Donald Ervin |
Language: |
Russian |
Binding: |
Hardcover |
Category: |
Computers |
Pages: |
960 |
Era/Year: |
2019 |
other ISBNs: |
978-5-907144-06-4 |
Listing details
Seller policies: | |
---|---|
Shipping discount: |
Shipping weights of all items added together for savings. |
Posted for sale: |
More than a week ago |
Item number: |
1325978160 |
Item description
Sent by Ruslania.com promptly from Helsinki, Finland.Description:Eta kniga predstavljaet soboj tom 4A, poskolku sam tom 4 javljaetsja mnogotomnikom. Kombinatornyj poisk - bogataja i vazhnaja tema, i Knut privodit slishkom mnogo novogo, interesnogo i poleznogo materiala, chtoby ego mozhno bylo razmestit v odnom ili dvukh (a mozhet byt, dazhe v trekh) tomakh. Odna eta kniga vkljuchaet okolo 1500 uprazhnenij s otvetami dlja samostojatelnoj raboty, a takzhe sotni poleznykh faktov, kotorye vy ne najdete ni v kakikh drugikh publikatsijakh. Tom 4A opredelenno dolzhen zanjat svoe mesto na polke rjadom s pervymi tremja tomami etoj klassicheskoj raboty v biblioteke kazhdogo sereznogo programmista.
V etom tome rassmatrivajutsja metody, pozvoljajuschie kompjuteram effektivno rabotat s zadachami gigantskogo razmera. Rassmatrivaemyj material nachinaetsja s bulevykh funktsij i tekhnologij i trjukov raboty s bitami, zatem vsestoronne rassmatrivaetsja generatsija vsekh kortezhej i perestanovok, vsekh sochetanij i razbienij, i vsekh derevev.
Etot mnogotomnyj trud shiroko izvesten kak polnoe izlozhenie informatiki. V techenie desjatiletij pervye tri toma sluzhili bestsennym istochnikom informatsii po teorii i praktike programmirovanija dlja studentov, teoretikov i praktikov. Uchenye voskhischalis krasotoj i izjaschestvom analiza Knuta, v to vremja kak praktikujuschie programmisty uspeshno primenjali ego "povarennuju knigu" dlja reshenija ezhednevnykh zadach.
Ob avtore
Donald E.
Knut - avtor vsemirno izvestnoj serii knig, posvjaschennoj osnovnym algoritmam i metodam vychislitelnoj matematiki, a takzhe sozdatel nastolnykh izdatelskikh sistem TEX i METAFONT, prednaznachennykh dlja verstki fiziko-matematicheskoj literatury. Ego peru prinadlezhat 26 knig i bolee 160 statej. Donald Knut javljaetsja pochetnym professorom Stanfordskogo universiteta v oblasti programmirovanija i vychislitelnoj matematiki. V nastojaschee vremja on polnostju zanjat napisaniem novykh knig serii Iskusstvo programmirovanija. Rabotu nad pervym tomom on nachal esche v 1962 godu, srazu posle okonchanija Kalifornijskogo tekhnologicheskogo instituta (California Institute of Technology).
Professor Knut udostoen mnogochislennykh premij i nagrad, sredi kotorykh mozhno otmetit ACM Turing Award, Medal of Science prezidenta Kartera i ASM Steele Prize za seriju nauchno-populjarnykh statej. V nojabre 1996 goda Donald Knut byl udostoen prestizhnoj nagrady Kyoto Prize v oblasti peredovykh tekhnologij.
Otzyvy
Uroven pervykh trekh tomov stol vysok, i v nikh projavleno stol shirokoe i glubokoe znakomstvo s iskusstvom programmirovanija, chto vpolne dostatochnym obzorom buduschikh tomov budet kratkoe "Vyshel tom n Iskusstva programmirovanija Knuta".
- Data Processing Digest
Vyshel tom n Iskusstva programmirovanija Knuta, gde n = 4A.
V etom dolgozhdannom novom tome staryj master udeljaet vnimanie kak rjadu svoikh izdavna ljubimykh tem - shirokoslovnym vychislenijam i kombinatornoj generatsii (ischerpyvajuschemu perechisleniju fundamentalnykh kombinatornykh obektov, takikh kak perestanovok, razbienij ili derevev), tak i bolee pozdnim uvlechenijam, takim kak binarnye diagrammy reshenij.
Priznaki kachestva, otlichajuschie ego prezhnie toma, projavilis i v novom tome: detalnoe opisanie osnov, illjustratsija khorosho podobrannymi primerami, inogda ekskursy v bolee ezoterichnye temy i zadachi na ostrie veduschikhsja issledovanij; bezuprechnyj stil izlozhenija, pripravlennyj dolej jumora; obshirnye nabory uprazhnenij - vse s reshenijami ili poleznymi ukazanijami; dolzhnoe vnimanie istoricheskim voprosam; realizatsija mnozhestva algoritmov v ego klassicheskom poshagovom stile.
Na kazhdoj stranitse knigi imeetsja udivitelnoe kolichestvo informatsii. Ochevidno, Knut dolgo i tschatelno razmyshljal o tom, kakie rezultaty javljajutsja naibolee tsentralnymi i vazhnymi, i o tom, kak naibolee intuitivno ponjatno i kratko izlozhit etot material. Poskolku oblasti, okhvachennye etim tomom, uvelichilis s momenta pervykh chernovykh zametok o nikh prosto vzryvnym obrazom, eto prosto udivitelno - kak on sumel vtisnut stol tschatelnoe rassmotrenie v takoj nebolshoj obem.
- Frenk Raski, (Frank Ruskey), fakultet informatiki universiteta Viktorii (Department of Computer Science, University of Victoria)
Perevodchik: Krasikov I. V.
Why are we showing these items?
Booth
ruslania's booth |
![]() |

-
Refine your browsing experience
We can show you more items that are exactly like the original item, or we can show you items that are similar in spirit. By default we show you a mix.
This item has been added to your cart

View Cart or continue shopping.



Get an item reminder
We'll email you a link to your item now and follow up with a single reminder (if you'd like one). That's it! No spam, no hassle.
Already have an account?
Log in and add this item to your wish list.