π #Racket v9.0: Because clearly, the world was clamoring for yet another way to thread those needles of computational complexity! π‘ Now with *parallel threads*, they promise to revolutionize... exactly what their previous efforts already claimed to do. π Isn't #innovation grand when you can reintroduce the same concept with shiny new buzzwords? π
https://blog.racket-lang.org/2025/11/racket-v9-0.html #v9.0 #ComputationalComplexity #ParallelThreads #TechNews #HackerNews #ngated
#computationalcomplexity
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 real reason we "need" SIMD? Because apparently, more #performance is the antidote to all life's problems, according to Nicholas Wilt's love letter to computational complexity. π οΈ Meanwhile, the rest of us are still trying to figure out why our computers crash every time we open a spreadsheet. π€·ββοΈ
https://parallelprogrammer.substack.com/p/why-we-need-simd-the-real-reason #SIMD #computationalcomplexity #techissues #computercrash #spreadsheetwoes #HackerNews #ngated
Computational Complexity of Neural Networks
https://lunalux.io/introduction-to-neural-networks/computational-complexity-of-neural-networks/
#HackerNews #ComputationalComplexity #NeuralNetworks #AIResearch #MachineLearning #TechTrends
This is an example of amortized complexity and Strassen's "asymptotic spectra" (nice monograph by Zuiddam & Wigderson: https://www.math.ias.edu/~avi/PUBLICATIONS/WigdersonZu_Final_Draft_Oct2023.pdf)
Strassen developed this to understand the #complexity of matrix multiplication and #tensors, but it turns out to also show up in a bunch of places:
- #Entropy
- #Quantum information
- Shannon capacity of graphs
- Communication complexity https://en.wikipedia.org/wiki/Communication_complexity#Information_Complexity
- Circuit complexity (Robere & Zuiddam https://eccc.weizmann.ac.il/report/2021/035)
#math #probability #ComputationalComplexity #TCS #InformationTheory
Real coin flips are ~49-51 not 50-50 https://www.scientificamerican.com/article/scientists-destroy-illusion-that-coin-toss-flips-are-50-50/
But you can guarantee equal probability with a simple trick! Flip 2x in a row starting with the same side up.
HT->call it H
TH->call it T
HH,TT->try again
(due to von Neumann https://en.wikipedia.org/wiki/Randomness_extractor#Von_Neumann_extractor)
This leads to randomness extractors: from a given random process, what's the biggest uniform distribution you can get efficiently?
Randomness extractors give another interpretation of #entropy:
avg # bits needed to *describe* the outcome
=
# uniformly random bits you can *extract* from the outcome
#math #probability #ComputationalComplexity #TCS #InformationTheory
π₯³π Wow, a math paper won a prize and it tastes great too! ππΊ Let's all pretend we understand why "explicit two-source extractors" are the new gluten-free avocado toast of computational complexity. ππ
https://blog.computationalcomplexity.org/2025/06/the-new-godel-prize-winner-tastes-great.html #mathpaper #prizewinning #explicitextractors #computationalcomplexity #foodtrends #HackerNews #ngated
The New Godel Prize Winner Tastes Great and Is Less Filling
https://blog.computationalcomplexity.org/2025/06/the-new-godel-prize-winner-tastes-great.html
#HackerNews #GodelPrize #ComputationalComplexity #TechNews #Innovation #Humor
Trying to tame the NP-complete beast β writing a paper about my algorithm for solving the Hamiltonian cycle #graphs #hamiltoncycle #npcomplete #graphalgorithms #computerscience #heuristics #optimization #research #computationalcomplexity #hacking #latex
Trying to tame the NP-complete beast β writing a paper about my algorithm for solving the Hamiltonian cycle #graphs #hamiltoncycle #npcomplete #graphalgorithms #computerscience #heuristics #optimization #research #computationalcomplexity #hacking
Taught a bonus lecture for a course on Algorithms for NP-hard Problems today. Material won't be on the exam, so technically, this lecture was "just for fun".
Quite some pressure to make coming to class on Friday morning 8:45am worth it for a gang of 20-year-olds.
Students were a hoot. They were listening actively and participating. Great to meet them. Had a blast π
Afterwards, some of them thanked me for the "really great lecture" π₯Ί
Ab-so-lute-ly exhausted now.
#AcademicChatter #AcademicLife #StudentLife #ComputationalComplexity #ComputerScience #Algorithms #AcademicMastodon #Teaching #HigherEducation #University #TUDelft
Dr. Alexandra Kolla will be presenting "Quantum Max Cuts and Local Hamiltonians" in the Codes & Expansions (CodEx) seminar tomorrow Mar 4, 2025 at 10am PST = 19:00 CET. Sign up on the website: https://www.math.colostate.edu/~king/codex/
I got stuck in a bathroom stall today at #CGTC. Best pun: I had a PeeSPACE-hard problem.
This is a joke, but not a lie.
If you see a door handle like these photos, you push like so to release the lock.
Harm Derksen will be talking about "Invariant Theory and [Computational] Complexity" in tomorrow's online CodEx Seminar: https://www.math.colostate.edu/~king/codex/
Tue Jan 28, 2025 10am Pacific
Sign up on the website for the zoom link
#desire #talk #computationalcomplexity #computerscience #girlfriend #phdstudent #doctoratestudent #phd #doctorate #motivation #meme #memes #phdmotivation #phdmeme #phdmemes #phdlife #phdstudentlife #phdtroll #doctoratemotivation #doctoratememe #doctoratememes #doctoratelife #doctoratestudentlife #doctoratetroll
@onlineparallels Adding more hashtags for visibility of what's shaping up to be a cool online event paralleling ITCS '25!
https://sites.google.com/view/itcs2025onlineparallel
#math #TCS #ComputationalComplexity #complexity #online #TheoryCS
Heard of AIM SQuaREs? (if you haven't, you should: https://aimath.org/programs/squares/)
Now we have Simons-Jane Circles (https://simons.berkeley.edu/participate/circles-call-proposals), at what I'd call the intersection of #Math and
#CS (#TheoryCS).
Both fund small collaborations (~3-6) for 3-4 weeklong visits over 2-3 yrs.
Given a decision problem Ξ , I need a name for the polytope constructed by taking the convex hull of the characteristic vectors (or binary inputs of fixed length) corresponding to "yes" instances. If nobody has a better suggestion I might use "the characteristic polytope of Ξ ". OTOH, for $reasons I'd much rather use something more standard / widespread.
#Tensors Everywhere in #Complexity
Me! At the colloquium.
With connections to geometric complexity theory, graph isomorphism, group isomorphism, #quantum entanglement, and post-quantum-secure cryptosystems.
Online Fri Oct 25 2024 at IU Bloomington CS: https://events.iu.edu/siceiub/event/1663944-tensors-everywhere-in-complexity
Client Info
Server: https://mastodon.social
Version: 2025.07
Repository: https://github.com/cyevgeniy/lmst