Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=6986450

Tiling complexity of small n-ominoes (N<10)

Author
RAWSTHORNE, D. A1
[1] 12609 Bluhill Rd, Silver Spring MD 20906, United States
Source

Discrete mathematics. 1988, Vol 70, Num 1, pp 71-75 ; ref : 33 ref

CODEN
DSMHA4
ISSN
0012-365X
Scientific domain
Computer science; Mathematics
Publisher
Elsevier, Amsterdam
Publication country
Netherlands
Document type
Article
Language
English
Keyword (fr)
Combinatoire Complexité Configuration Recouvrement ensemble
Keyword (en)
Combinatorics Complexity Configuration Set covering
Keyword (es)
Combinatoria Complejidad Configuración Recubrimiento conjunto
Classification
Pascal
001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02B Combinatorics. Ordered structures / 001A02B01 Combinatorics / 001A02B01B Designs and configurations

Discipline
Mathematics
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
6986450

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Access to the document

Searching the Web