Computational Complexity of Cast Puzzles

DOI10.1007/978-3-642-10631-6_14zbMath1272.68156MaRDI QIDQ3652198

Kento Sasaki, Chuzo Iwamoto, Kenji Nishio, Kenichi Morita

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_14

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

Related Items

On a theorem of Razborov