Efficient Algorithms for Listing Combinatorial Structures 在線電子書 pdf 下載 txt下載 epub 下載 mobi 下載 2024

☆☆☆☆☆
簡體網頁||繁體網頁

Goldberg, Leslie Ann 作者

譯者

2009-7 出版日期

180 頁數

$ 50.85 價格

叢書系列

9780521117883 圖書編碼

Efficient Algorithms for Listing Combinatorial Structures 在線電子書圖書標籤: 計算機科學 for Structures Programming Listing Efficient Combinatorial Algorithms

喜歡 Efficient Algorithms for Listing Combinatorial Structures 在線電子書的讀者還喜歡

下載鏈接在頁面底部

點擊這裡下載

facebook linkedin mastodon messenger pinterest reddit telegram twitter viber vkontakte whatsapp 複製鏈接

想要找書就要到圖書目錄大全

book.wenda123.org

立刻按 ctrl+D收藏本頁

你會得到大驚喜!!

發表於2024-11-27

Efficient Algorithms for Listing Combinatorial Structures 在線電子書 epub 下載 mobi 下載 pdf 下載 txt 下載 2024

Efficient Algorithms for Listing Combinatorial Structures 在線電子書 epub 下載 pdf 下載 mobi 下載 txt 下載 2024

Efficient Algorithms for Listing Combinatorial Structures 在線電子書 pdf 下載 txt下載 epub 下載 mobi 下載 2024

Efficient Algorithms for Listing Combinatorial Structures 在線電子書用戶評價

評分☆☆☆☆☆

Efficient Algorithms for Listing Combinatorial Structures 在線電子書著者簡介

Efficient Algorithms for Listing Combinatorial Structures 在線電子書 pdf 下載 txt下載 epub 下載 mobi 在線電子書下載

Efficient Algorithms for Listing Combinatorial Structures 在線電子書圖書描述

First published in 1993, this thesis is concerned with the design of efficient algorithms for listing combinatorial structures. The research described here gives some answers to the following questions: which families of combinatorial structures have fast computer algorithms for listing their members? What general methods are useful for listing combinatorial structures? How can these be applied to those families which are of interest to theoretical computer scientists and combinatorialists? Amongst those families considered are unlabelled graphs, first order one properties, Hamiltonian graphs, graphs with cliques of specified order, and k-colourable graphs. Some related work is also included, which compares the listing problem with the difficulty of solving the existence problem, the construction problem, the random sampling problem, and the counting problem. In particular, the difficulty of evaluating Polya's cycle polynomial is demonstrated.

Efficient Algorithms for Listing Combinatorial Structures 在線電子書下載 mobi epub pdf txt 在線電子書下載

想要找書就要到圖書目錄大全

book.wenda123.org

立刻按 ctrl+D收藏本頁

你會得到大驚喜!!