Year-end Sale % OFF 
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.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
