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: | YuhPyng Shieh, 謝育平 |
---|---|
Other Authors: | Jieh Hsiang |
Format: | Others |
Language: | en_US |
Published: |
2001
|
Online Access: | http://ndltd.ncl.edu.tw/handle/65476599091029023021 |
Similar Items
-
Enumerative combinatorics related to partition shapes
by: Sjöstrand, Jonas
Published: (2007) -
Enumerative combinatorics of posets
by: Carroll, Christina C.
Published: (2008) -
Gamma positivity in enumerative combinatorics
by: Han, Bin
Published: (2019) -
Applications in Enumerative Combinatorics of Infinite Weighted Automata and Graphs
by: R. De Castro, et al.
Published: (2014-06-01) -
Urn Sampling Without Replacement: Enumerative Combinatorics in R
by: Robin K. S. Hankin
Published: (2007-01-01)