LEADER 01536nam  2200457Ia 450 
001 9910709938903321
005 20180711120939.0
024 8 $aGOVPUB-C13-75310ef399fc780473bdc802bdc1a4a3
035   $a(CKB)5470000002474879
035   $a(OCoLC)86119176
035   $a(OCoLC)995470000002474879
035   $a(EXLCZ)995470000002474879
100   $a20070323d2006      ua             0
101 0 $aeng
135   $aurbn|||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 13$aAn algorithm for generating very large covering arrays /$fD. Richard Kuhn
210  1$a[Gaithersburg, MD] :$cU.S. Dept. of Commerce, National Institute of Standards and Technology,$d[2006].
215   $a1 online resource (4 unnumbered pages)
225 1 $aNISTIR ;$v7308
300   $a"20 March 2006."
300   $aContributed record: Metadata reviewed, not verified. Some fields updated by batch processes.
300   $aTitle from page [1], viewed March 5, 2007.
606   $aComputer algorithms
606   $aComputer algorithms$2fast
615  0$aComputer algorithms.
615  7$aComputer algorithms.
700   $aKuhn$b D. Richard$01162181
712 02$aNational Institute of Standards and Technology (U.S.)
801  0$bNBS
801  1$bNBS
801  2$bOCLCQ
801  2$bOCLCF
801  2$bOCLCO
801  2$bOCLCQ
906   $aBOOK
912   $a9910709938903321
996   $aAn algorithm for generating very large covering arrays$93435405
997   $aUNINA