Abstract
We prove the NP-hardness of two fundamental problems in mechanism design. Given a set of rigid parts and prescribed joints, the first problem consists in deciding whether there exists an assembly of these parts matching the link constraints. Given a set of rigid parts and prescribed joints with parameterized dimensions, the second problem consists in deciding if there exists some dimensioning making the assembly mobile. The proof of hardness makes use of a reduction from Partition Problem for the first problem and from 3SAT for the second one.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
