ICALP 2026 accepted papers list is out! https://icalppodcspaa2026.cs.rhul.ac.uk/icalp-accepted/
ICALP 2026 accepted papers list is out! https://icalppodcspaa2026.cs.rhul.ac.uk/icalp-accepted/
POV: you need a break from your vacation so you attend a seminar about a cool new paper at your old university. ๐ค
paper: https://dl.acm.org/doi/10.1145/3776643
preprint: https://arxiv.org/abs/2505.05162
#AcademicChatter #AcademicMastodon #ProfessorLife #LatourOnTour #ComputationalComplexity #Concurrency #ComputerScience
[Show GN: ManiSurve โ 10,000๊ฐ ๋ ธ๋ NP ๋ฌธ์ ๋ฅผ 0.09์ด ๋ง์ ํด๊ฒฐํ๋ ๋คํญ ์๊ฐ ์์ง
ManiSurve v1.5๋ NP-Complete ๋ฌธ์ ๋ฅผ ๋คํญ ์๊ฐ(P) ๋ด์ ํด๊ฒฐํ๋ ์๋ก์ด ์์ง์ผ๋ก, 10,000๊ฐ ๋ ธ๋์ 50,000๊ฐ ๊ฐ์ ์ ๊ฐ์ง ๊ทธ๋ํ ์ปฌ๋ฌ๋ง ๋ฌธ์ ๋ฅผ 0.09์ด ๋ง์ ํด๊ฒฐํ์ต๋๋ค. ์ด์ฐ์ ์ถฉ๋์ ๋ฆฌ๋ง ๋ค์์ฒด ์์ ์ฐ์์ ์ธ ๊ณก๋ฅ ๋ก ํด์ํ์ฌ ์ง์ ์๊ฐ์ ๋ฒฝ์ ๊นจ๋ ๋ก์ง์ ์ฌ์ฉํ์ต๋๋ค. ๊ฐ๋ฐ์๋ ์ด๋ณด ์ฐ๊ตฌ์๋ก์ ์ปค๋ฎค๋ํฐ์ ํผ๋๋ฐฑ์ ์์ฒญํ๋ฉฐ, GitHub์ ์ฝ๋๋ฅผ ๊ณต๊ฐํ์ต๋๋ค.
https://news.hada.io/topic?id=27084
#npcomplete #algorithm #graphcoloring #manisurve #computationalcomplexity
To those who are interested in the 1984 entries:
On page 633 they discuss the development of interior point methods, following the work of Narendra Karmarkar in 1984, page 810 contains the associated bibliography entry, and page 811 contains the bibliography entry for the English translation of Levin's paper on Universal Search Problems.
I don't know why 1984 is the only year with an index entry. I can only assume it's an Easter egg.
#Search #ComputationalComplexity #1984 #Algorithms #ProfessorLife #EasterEgg #AcademicMastodon #AcademicChatter
On Monday, November 17, at 3:30pm ET, I get to give the next VCGT talk on the computational complexity of the game #BattleSheep: https://sites.google.com/view/virtual-cgt/seminar
Abstract: Battle Sheep is a board game published by Blue Orange Games where players take turns moving stacks of sheep tokens around a hexagonal board, always leaving at least one sheep behind. In this talk we'll learn the basics of the game, play once, and finally show that determining the winnability of the game is PSPACE-complete. This talk assumes no prior knowledge of computational complexity.
The seminar started after the Virtual Combinatorial Games Workshop in June 2020. There will be a mix of research talks, tutorials, and coffee meetings. If you wish to attend, please contact Melissa Huggan (email address at the bottom) to be added to the email list for the video call link.
Computational Complexity of Neural Networks
https://lunalux.io/introduction-to-neural-networks/computational-complexity-of-neural-networks/
#HackerNews #ComputationalComplexity #NeuralNetworks #AIResearch #MachineLearning #TechTrends