本本书屋

 本本书屋 logo

Efficient Algorithms for Listing Combinatorial Structures 2024 pdf epub mobi 电子书

Efficient Algorithms for Listing Combinatorial Structures
☆☆☆☆☆
简体网页||繁体网页

Efficient Algorithms for Listing Combinatorial Structures 2024 pdf epub mobi 电子书 著者简介

Efficient Algorithms for Listing Combinatorial Structures 电子书 图书目录

下载链接在页面底部


点击这里下载
    
linkedin mastodon messenger pinterest reddit telegram viber vkontakte whatsapp 复制链接
想要找书就要到 本本书屋
立刻按 ctrl+D收藏本页
你会得到大惊喜!!

发表于2024-12-27

Efficient Algorithms for Listing Combinatorial Structures 2024 pdf epub mobi 电子书

Efficient Algorithms for Listing Combinatorial Structures 2024 pdf epub mobi 电子书

Efficient Algorithms for Listing Combinatorial Structures 2024 pdf epub mobi 电子书


喜欢 Efficient Algorithms for Listing Combinatorial Structures 电子书 的读者还喜欢


Efficient Algorithms for Listing Combinatorial Structures 电子书 读后感

评分☆☆☆☆☆

评分☆☆☆☆☆

评分☆☆☆☆☆

评分☆☆☆☆☆

评分☆☆☆☆☆

类似图书 点击查看全场最低价
出版者:
作者:Goldberg, Leslie Ann
出品人:
页数:180
译者:
出版时间:2009-7
价格:$ 50.85
装帧:
isbn号码:9780521117883
丛书系列:

图书标签: 计算机科学  for  Structures  Programming  Listing  Efficient  Combinatorial  Algorithms   

Efficient Algorithms for Listing Combinatorial Structures 2024 pdf epub mobi 电子书 图书描述

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 2024 pdf epub mobi 电子书
Efficient Algorithms for Listing Combinatorial Structures 2024 pdf epub mobi 电子书
想要找书就要到 本本书屋
立刻按 ctrl+D收藏本页
你会得到大惊喜!!

Efficient Algorithms for Listing Combinatorial Structures 2024 pdf epub mobi 用户评价

评分☆☆☆☆☆

评分☆☆☆☆☆

评分☆☆☆☆☆

评分☆☆☆☆☆

评分☆☆☆☆☆

Efficient Algorithms for Listing Combinatorial Structures 2024 pdf epub mobi 电子书

分享链接

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




相关图书



服务条款
联系我们
关于我们
隐私政策

本站所有内容均为互联网搜索引擎提供的公开搜索信息，本站不存储任何数据与内容，任何内容与数据均与本站无关，如有需要请联系相关搜索引擎包括但不限于百度，google,bing,sogou 等

友情链接

中国国家图书馆
国立台湾图书馆
美国国会图书馆
开放图书馆 openlibrary.org

© 2024 onlinetoolsland.com All Rights Reserved. 本本书屋 版权所有