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 在线电子书的读者还喜欢

下载链接在页面底部

点击这里下载

想要找书就要到图书目录大全

book.wenda123.org

立刻按 ctrl+D收藏本页

你会得到大惊喜!!

发表于2024-11-27

facebook linkedin mastodon messenger pinterest reddit telegram twitter viber vkontakte whatsapp 复制链接

Efficient Algorithms for Listing Combinatorial Structures 在线电子书 epub 下载 mobi 下载 pdf 下载 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 在线电子书图书目录

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收藏本页

你会得到大惊喜!!