News for hackers. Stuff that matters.
Re:A proof P = NP was accidentally published in TOCT by TrainedMonkey on Monday July 19, 2021 @06:01PM (#27887764)
O(n*1000000) is linear, polynomial would be O(N^Y), where Y is the degree of polynomial.
Re:A proof P = NP was accidentally published in TOCT by yifanl on Monday July 19, 2021 @06:04PM (#27887789)
linear time complexity problems are a subset of polynomial time complexity problems, if we're being pedantic.
Re:A proof P = NP was accidentally published in TOCT by ineedasername on Monday July 19, 2021 @06:19PM (#27887952)
I think we can all agree that being pedantic is part of the foundation that makes HN be HN.
Re:A proof P = NP was accidentally published in TOCT by shoo on Monday July 19, 2021 @06:05PM (#27887812)
in the case where Y=1 you both agree.