Pautasso, Alain (1988) Combinatorial searching for coverings by rook domains using the Blokhuis and Lam method. Masters thesis, Concordia University.
![[img]](http://spectrum.library.concordia.ca/style/images/fileicons/application_pdf.png)
| PDF 3244Kb |
| Divisions: | Concordia University > Faculty of Engineering and Computer Science > Computer Science and Software Engineering |
|---|---|
| Item Type: | Thesis (Masters) |
| Authors: | Pautasso, Alain |
| Pagination: | vii, 94 leaves ; 29 cm. |
| Institution: | Concordia University |
| Degree Name: | Theses (M.Comp.Sc.) |
| Program: | Computer Science and Software Engineering |
| Date: | 1988 |
| ID Code: | 2734 |
| Deposited By: | Concordia University Libraries |
| Deposited On: | 27 Aug 2009 15:20 |
| Last Modified: | 08 Dec 2010 10:28 |
| Related URLs: |
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
