Finding smooth maps is NP-complete

DOI10.1016/S0020-0190(02)00429-5zbMath1173.68531OpenAlexW2091976156MaRDI QIDQ1007538

Jan Poland

Publication date: 23 March 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00429-5

zbMATH Keywords

computational complexitysmooth mapsmotor control unit calibration

Mathematics Subject Classification ID

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

Cites Work

• Minesweeper is NP-complete.
• Unnamed Item
• Unnamed Item

This page was built for publication: Finding smooth maps is NP-complete