| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 810 1 |
| Ultima descărcare din IBN: 2017-02-21 20:08 |
 SM ISO690:2012DERIYENKO, Ivan. Once more about Brualdi's conjecture. In: Quasigroups and Related Systems, 2010, vol. 18, nr. 2(24), pp. 127-136. ISSN 1561-2848. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
| Quasigroups and Related Systems | ||||||
| Volumul 18, Numărul 2(24) / 2010 / ISSN 1561-2848 | ||||||
|
||||||
| Pag. 127-136 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
A new algorithm for nding quasi-complete or complete mappings for Latin squares is presented. This algorithm is a modi cation of the previous algorithm by this author from 1988. |
||||||
| Cuvinte-cheie quasigroup, complete mapping, algorithm, quasicomplete mapping |
||||||
|
DataCite XML Export
<?xml version='1.0' encoding='utf-8'?> <resource xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xmlns='http://datacite.org/schema/kernel-3' xsi:schemaLocation='http://datacite.org/schema/kernel-3 http://schema.datacite.org/meta/kernel-3/metadata.xsd'> <creators> <creator> <creatorName>Deriyenko, I.I.</creatorName> <affiliation>Kremenchuk National University, Ucraina</affiliation> </creator> </creators> <titles> <title xml:lang='en'>Once more about Brualdi's conjecture</title> </titles> <publisher>Instrumentul Bibliometric National</publisher> <publicationYear>2010</publicationYear> <relatedIdentifier relatedIdentifierType='ISSN' relationType='IsPartOf'>1561-2848</relatedIdentifier> <subjects> <subject>quasigroup</subject> <subject>complete mapping</subject> <subject>quasicomplete mapping</subject> <subject>algorithm</subject> </subjects> <dates> <date dateType='Issued'>2010-08-03</date> </dates> <resourceType resourceTypeGeneral='Text'>Journal article</resourceType> <descriptions> <description xml:lang='en' descriptionType='Abstract'>A new algorithm for nding quasi-complete or complete mappings for Latin squares is presented. This algorithm is a modi cation of the previous algorithm by this author from 1988.</description> </descriptions> <formats> <format>application/pdf</format> </formats> </resource>
|
|
|
