A multiparameter analysis of domino tiling with an application to concurrent systems

DOI10.1016/0304-3975(92)90004-YzbMath0756.90097OpenAlexW2056578936MaRDI QIDQ1193883

Hsu-Chun Yen

Publication date: 27 September 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90004-y

zbMATH Keywords

complexities of two domino problemsdomino gametiling a rectangle

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) 2-person games (91A05)

Related Items (1)

Complexity analysis of propositional concurrent programs using domino tiling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of deciding fair termination of probabilistic concurrent finite-state programs
• The complexity of problems in systems of communicating sequential processes
• Techniques for separating space complexity classes
• A multiparameter analysis of the boundedness problem for vector addition systems
• Domino-tiling games
• Recurring Dominoes: Making the Highly Undecidable Highly Understandable
• Gradually intractable problems and nondeterministic log-space lower bounds
• Some combinatorial game problems require Ω( n ^k ) time
• Classes of Pebble Games and Complete Problems
• The undecidability of the domino problem

This page was built for publication: A multiparameter analysis of domino tiling with an application to concurrent systems