A codicity undecidable problem in the plane. (Q1401375): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An undecidable problem about rational sets and contour words of polyominoes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The undecidability of the domino problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tiling with sets of polyominoes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3735714 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recurring Dominoes: Making the Highly Undecidable Highly Understandable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on a class of tiling problems / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0304-3975(03)00029-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2064947749 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:23, 30 July 2024

scientific article
Language Label Description Also known as
English
A codicity undecidable problem in the plane.
scientific article

    Statements

    A codicity undecidable problem in the plane. (English)
    0 references
    0 references
    0 references
    17 August 2003
    0 references
    Polyomino
    0 references
    Tiling
    0 references
    Undecidability
    0 references
    Code
    0 references
    Domino tiling
    0 references

    Identifiers