k-強制臨界集的大小

Full metadata record

DC Field	Value	Language
dc.contributor.author	戴詩珍	en_US
dc.contributor.author	Shih-Chen Tai	en_US
dc.contributor.author	傅恆霖	en_US
dc.contributor.author	史青林	en_US
dc.contributor.author	Hung-Lin Fu	en_US
dc.contributor.author	Chin-Lin Shiue	en_US
dc.date.accessioned	2014-12-12T02:24:02Z	-
dc.date.available	2014-12-12T02:24:02Z	-
dc.date.issued	1999	en_US
dc.identifier.uri	http://140.113.39.130/cdrfb3/record/nctu/#NT880507025	en_US
dc.identifier.uri	http://hdl.handle.net/11536/66176	-
dc.description.abstract	臨界集是一個極小 ( minimal ) 的部份拉丁方陣，使得存在拉丁方陣可以包含此臨界集，且此方陣是唯一的。臨界集的大小是指此臨界集中已填位置的個數。在本篇論文中，首先我們將介紹 k-強制臨界集的概念，然後研究此類臨界集的大小。	zh_TW
dc.description.abstract	A critical set is a minimal uniquely completable partial latin square. The size of a critical set is the number of filled cells within it. In this thesis, we first introduce the notion of k-forced critical sets and then study the size of such critical sets.	en_US
dc.language.iso	en_US	en_US
dc.subject	臨界集	zh_TW
dc.subject	k-強制	zh_TW
dc.subject	critical set	en_US
dc.subject	k-forced	en_US
dc.title	k-強制臨界集的大小	zh_TW
dc.title	On the Size of k-forced Critical Set	en_US
dc.type	Thesis	en_US
dc.contributor.department	應用數學系所	zh_TW
Appears in Collections:	Thesis