#nphard — Public Fediverse posts
Live and recent posts from across the Fediverse tagged #nphard, aggregated by home.social.
-
https://www.europesays.com/dk/43411/ Amsterdam’s Reson8 raises €5 million to build speech AI infrastructure that resonates across Europe #Amsterdam #BaldertonCapital #JarnoVerhagen #Netherlands #NPHard #RaoulRitter #Reson8 #SpeechAI #SpeechRecognition #ThomasKluiters
-
The fact that we've been building #computer #printers since the 60ies and we still haven't found a solution that really works, makes me think #printing is actually NP-hard. #nphard #nphardproblems #computers #computerscience
-
Compiling #Rust is NP-hard (July 2021) - by compilercrimes
https://compilercrim.es/rust-np/
"...though it's not the flagship borrow checking that's at fault. What I noticed, and would like to share with you today, is that the exhaustiveness checking performed by the Rust compiler on match patterns is a superset of the #SAT problem."
-
Mayyyyyybe the #TandSTeams wasn't such a flex on laying off unless #fines was the plan... All along was, I.T.?
#Governance is an #NPHard (?) equation or is this defined by a #ToS ? Hmm....
Ooooh, I know! Mayyyybe iF you APPLY the #ToS by STAFFING #TandSTeams ? ¯\_ಠ◡ಠ_/¯
THAT'S. WHAT. T&S. DOES?
¯\_ಠ_ಠ_/¯ @yoyoel
-
Target app goes #NPhard!
-
#BingChat (precise) has concluded that P=NP
I asked it to write a Python script that when given a graph where there are no more than 5 edges for every vertex, it returns the length of the longest path that visits each vertex no more than once. Then lifted the edge count restriction.
In both cases it claimed polynomial time complexity to solve an NP-hard problem
#ComputerScience #complexity #PequalsNP #NPhard #NPcomplete #python #GraphTheory
