Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
xmcqdpt2
on April 3, 2023
|
parent
|
context
|
favorite
| on:
Can water solve a maze? [video]
They are not NP at all. A perfect maze (with one solution) as a connectivity graph is a tree. Finding the path through a tree can be done by DFS in linear O(N) time.
brokensegue
on April 3, 2023
[–]
all P problems are in NP \pedantic
Join us for
AI Startup School
this June 16-17 in San Francisco!
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
