#npcomplete — Public Fediverse posts

Algorithm for NP-Complete Sudoku

https://zenodo.org/records/21420871

Comments: https://news.ycombinator.com/item?id=48954267

#HackerNews #Algorithm #NPComplete #Sudoku #Puzzle #Solving #Research #Zenodo

(quoting myself, from the article, slightly edited)

Seriously, we all need to just chill out and wasting money on these agentic AI loops to generate slop code. The invention of the LLM did not settle the question of whether or not all NP class problems are in the set of P class problems.

By all means, keep using your AI coding assistants to help you write software, if it makes you more productive. But you still need to provide a lot of guidance to the AI assistant to ensure the code that was written was correct. Don’t let it get into a loop trying to solve an NP-Complete coding challenge. And please, at least attempt to make it a little more efficient before you have other people start using it.

I wanted to write this article because of a discussion I had with my friends recently about how, in my experience, although AI coding assistants can write SQL code very well, they tend to have a lot of trouble crafting SQL schemas, because relational logic is a very hard thing to do for both computers and humans. And then I read this excellent article by Ed Zitron about people trying to solve these hard problems with “Agentic AI Loops”, that is, feeding LLM output into another LLM some number of times. So I want to explain why using Agentic Loops does not make hard problems easier to solve. In fact it is probably a bad idea to write large software applications with Agentic AI Loops, generally a very bad idea.

We are scheduled to discuss this article on the Lispy Gopher Climate podcast tomorrow.

(alternate link: https://ramin-honary.neocities.org/articles/the-hard-limits-of-ai)

#tech #AI #LLM #LLMs #ComplexityTheory #ComputerMath #Math #TuringComplete #NPComplete #LispyGopherClimate

In the latest episode of "Nerds Think They Can Solve Everything," missile defense is hilariously declared NP-Complete 🎯—as if the real issue isn’t, say, #geopolitics or a little thing called reality. But sure, let's pretend the fate of nations rests on an algorithm rather than human error and spy drama 🤦‍♂️.
https://smu160.github.io/posts/missile-defense-is-np-complete/ #NerdsThinkTheyCanSolveEverything #MissileDefense #NPComplete #AlgorithmReality #HackerNews #ngated

Missile Defense Is NP-Complete

https://smu160.github.io/posts/missile-defense-is-np-complete/

#HackerNews #MissileDefense #NPComplete #Algorithms #ComputerScience #HackerNews

[Перевод] Генерация кроссвордов: «достаточно хорошее» решение NP-полной задачи

Генерация кроссвордов — NP-полная задача. Каждая ячейка, в которой пересекаются два слова, создаёт ограничение, которому должны удовлетворять оба слова, и эти ограничения перемножаются в сетке, приводя к комбинаторному взрыву. Эффективного алгоритма, гарантирующего решение, не существует, но вооружившись подходящими эвристиками, можно создать нечто, работающее на удивление хорошо. В конце 2021 года, уже сильно после начала локдауна, моя одержимость кроссвордом газеты The New York Times превратилась в хобби-проект. Я хотел написать приложение с кроссвордами, понял, что мне нужны сами кроссворды, попробовал сочинять их вручную, осознал унылость этого процесса и задался вопросом: можно ли генерировать их алгоритмически? В этом году я наконец-то выпустил Crosswarped для iOS и Android — игру в кроссворды, созданную на основе генератора, описываемого в этой статье.

https://habr.com/ru/articles/980182/

#кроссворды #процедурная_генерация #npcomplete #npполная_задача #словари

In the thrilling new world of #Lean4, we've finally proven bounds for the Randomized MaxCut #Approximation algorithm that nobody asked for. 📈🔍 Now you can confidently cut those graphs like a pro while impressing... well, nobody. Because who doesn't love an NP-Complete problem just chilling with some approximation algorithms? 🙄🎉
https://abhamra.com/blog/randomized-maxcut/ #RandomizedMaxCut #NPComplete #Algorithms #GraphTheory #HackerNews #ngated

🚨 ALERT! 🚨 Someone thinks SAT solvers are the panacea to difficult #problems but forgot to solve the biggest problem: putting the reader to sleep in record time. 📉 Welcome to the riveting world of NP-complete problems, where saying "polynomial time" three times fast is more exciting than the content itself. 💤
https://vaibhavsagar.com/blog/2025/10/22/satisfying-solutions/ #SATsolvers #NPcomplete #boredom #techhumor #algorithmantics #HackerNews #ngated

🎩✨ Ah, the noble quest to solve the noble Hashtable Packing Problem — because #chess isn't hard enough without dragging Magic Bitboards into the mix. 🧙‍♂️🔮 Spoiler alert: it's still an NP-complete nightmare, but hey, at least you can feel smart for trying! 💤🔍
https://backscattering.de/chess/hashtable-packing/ #HashtablePackingProblem #MagicBitboards #NPComplete #CodingChallenges #HackerNews #ngated

#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

[Up and Atom] on the unsolved problem of whether NP-Complete problems can be decided in polynomial time
https://youtu.be/ctwX--JEzSA
#mathematics #ComputerScience #computability #ComplexityTheory #NPComplete

#Kingdomino is #NPComplete...

https://arxiv.org/abs/1909.02849