answersLogoWhite

0

You can use the bounded tiling problem. Given a problem in NP A, it has a turing machine M that recognizes its language. We construct tiles for the bounded tiling problem that will simulate a run of M.

Given input x, we ask if there is a tiling of the plane and answer that will simulate a run of M on x. We answer true iff there is such a tiling.

User Avatar

Wiki User

15y ago

Still curious? Ask our experts.

Chat with our AI personalities

LaoLao
The path is yours to walk; I am only here to hold up a mirror.
Chat with Lao
BeauBeau
You're doing better than you think!
Chat with Beau
JordanJordan
Looking for a career mentor? I've seen my fair share of shake-ups.
Chat with Jordan

Add your answer:

Earn +20 pts
Q: What is the first np-hard problem?
Write your answer...
Submit
Still have questions?
magnify glass
imp