Pautasso, Alain (1988) Combinatorial searching for coverings by rook domains using the Blokhuis and Lam method. Masters thesis, Concordia University.
|Divisions:||Concordia University > Faculty of Engineering and Computer Science > Computer Science and Software Engineering|
|Item Type:||Thesis (Masters)|
|Pagination:||vii, 94 leaves ; 29 cm.|
|Degree Name:||Theses (M.Comp.Sc.)|
|Program:||Computer Science and Software Engineering|
|Deposited By:||Concordia University Libraries|
|Deposited On:||27 Aug 2009 19:20|
|Last Modified:||04 Nov 2016 20:09|
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.
Repository Staff Only: item control page