The complexity of generalized domino tilings
Tiling planar regions with dominoes is a classical problem in which the decision and counting problems are polynomial. We prove a variety of hardness results (both NP- and #P-completeness) for different generalizations of dominoes in three and higher dimensions.
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Pak, Igor Yang, Jed |
| description | Tiling planar regions with dominoes is a classical problem in which the
decision and counting problems are polynomial. We prove a variety of hardness
results (both NP- and #P-completeness) for different generalizations of
dominoes in three and higher dimensions. |
| doi_str_mv | 10.48550/arxiv.1305.2154 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1305_2154</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1305_2154</sourcerecordid><originalsourceid>FETCH-LOGICAL-a654-b1affc128be9eb06e6327f479d33ba4c056bc9a56fdd57c5b401103db739c9d43</originalsourceid><addsrcrecordid>eNotzrsKwjAUgOEsDlLdnSQPYGvS5KRmFPEGgkv3ksuJBnqRKqI-vXiZ_u3nI2TCWSYXAGxu-ke8Z1wwyHIOckhm5Rmp65pLjY94e9Iu0BO22Js6vtBT3zWx7egt1rE9XUdkEEx9xfG_CSk363K1Sw_H7X61PKRGgUwtNyE4ni8sarRMoRJ5EWShvRDWSMdAWacNqOA9FA6sZJwz4W0htNNeioRMf9uvtrr0sTH9s_qoq49avAHzMTy0</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>The complexity of generalized domino tilings</title><source>arXiv.org</source><creator>Pak, Igor ; Yang, Jed</creator><creatorcontrib>Pak, Igor ; Yang, Jed</creatorcontrib><description>Tiling planar regions with dominoes is a classical problem in which the
decision and counting problems are polynomial. We prove a variety of hardness
results (both NP- and #P-completeness) for different generalizations of
dominoes in three and higher dimensions.</description><identifier>DOI: 10.48550/arxiv.1305.2154</identifier><language>eng</language><subject>Computer Science - Computational Complexity ; Computer Science - Computational Geometry ; Mathematics - Combinatorics</subject><creationdate>2013-05</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1305.2154$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1305.2154$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Pak, Igor</creatorcontrib><creatorcontrib>Yang, Jed</creatorcontrib><title>The complexity of generalized domino tilings</title><description>Tiling planar regions with dominoes is a classical problem in which the
decision and counting problems are polynomial. We prove a variety of hardness
results (both NP- and #P-completeness) for different generalizations of
dominoes in three and higher dimensions.</description><subject>Computer Science - Computational Complexity</subject><subject>Computer Science - Computational Geometry</subject><subject>Mathematics - Combinatorics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzrsKwjAUgOEsDlLdnSQPYGvS5KRmFPEGgkv3ksuJBnqRKqI-vXiZ_u3nI2TCWSYXAGxu-ke8Z1wwyHIOckhm5Rmp65pLjY94e9Iu0BO22Js6vtBT3zWx7egt1rE9XUdkEEx9xfG_CSk363K1Sw_H7X61PKRGgUwtNyE4ni8sarRMoRJ5EWShvRDWSMdAWacNqOA9FA6sZJwz4W0htNNeioRMf9uvtrr0sTH9s_qoq49avAHzMTy0</recordid><startdate>20130509</startdate><enddate>20130509</enddate><creator>Pak, Igor</creator><creator>Yang, Jed</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20130509</creationdate><title>The complexity of generalized domino tilings</title><author>Pak, Igor ; Yang, Jed</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a654-b1affc128be9eb06e6327f479d33ba4c056bc9a56fdd57c5b401103db739c9d43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Computer Science - Computational Complexity</topic><topic>Computer Science - Computational Geometry</topic><topic>Mathematics - Combinatorics</topic><toplevel>online_resources</toplevel><creatorcontrib>Pak, Igor</creatorcontrib><creatorcontrib>Yang, Jed</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Pak, Igor</au><au>Yang, Jed</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The complexity of generalized domino tilings</atitle><date>2013-05-09</date><risdate>2013</risdate><abstract>Tiling planar regions with dominoes is a classical problem in which the
decision and counting problems are polynomial. We prove a variety of hardness
results (both NP- and #P-completeness) for different generalizations of
dominoes in three and higher dimensions.</abstract><doi>10.48550/arxiv.1305.2154</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.1305.2154 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_1305_2154 |
| source | arXiv.org |
| subjects | Computer Science - Computational Complexity Computer Science - Computational Geometry Mathematics - Combinatorics |
| title | The complexity of generalized domino tilings |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T06%3A21%3A18IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=The%20complexity%20of%20generalized%20domino%20tilings&rft.au=Pak,%20Igor&rft.date=2013-05-09&rft_id=info:doi/10.48550/arxiv.1305.2154&rft_dat=%3Carxiv_GOX%3E1305_2154%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |