Partition Strategies for #P-Complete Problems with Applications to Enumerative Combinatorics
博士 === 國立臺灣大學 === 資訊工程學研究所 === 89 === This thesis deals with developing techniques for solving constraint satisfaction problems in #P class. Several enumeration problems in combinatorics such as enumerating Complete Mappings, Perfect Matchings and Permanents are discussed. These problems...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2001
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/65476599091029023021 |