An Extension of Stein-Lovasz Theorem and Some of its Applications
碩士 === 國立交通大學 === 應用數學系所 === 97 === The Stein-Lovasz theorem provides an algorithmic way to deal with the existence of good coverings and then to derive some upper bounds related to some combinatorial structures. In order to deal with more combinatorial problems, an extension of the classical Stein-...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/08952429334263990620 |