Title slide of a presentation. Title: The Complexity of Testing Message-Passing Concurrency Authors: Zhen Shi (NUS), Lasse Møldrup (Aarhus University), Umang Mathur (NUS), Andreas Pavlogiannis (Aarhus University)

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 […]

[Original post on mathstodon.xyz]

Title page of an academic paper. Title: UNO Is Hard, Even for a Single Player. Authors: Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno.

Well played.

link.springer.com/chapter/10.1007/978-3-64...

#uno #CardGames #ComputationalComplexity #FunWithAlgorithms #Algorithms #Algorithmics #Games #AI #ComputerScience #ProfessorLife

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 Levin's paper on Universal […]

How does the injectivity of Projected Entangled Pair States (PEPS) impact the complexity of evaluating local observables? Understanding this link is vital for advancing quantum algorithms. Share your thoughts! #QuantumComputing #Entanglement #ComputationalComplexity LINK

🚀💡 Exciting news! Ryan Williams has made a breakthrough in computational theory, showing how a bit of memory can change our view of time vs. space in computing. What could this mean for #AI's future? 🧠✨ #ComputationalComplexity #MathMagic LINK

The proof informs space-time tradeoffs by providing a *lower bound* on space needed. It sets a limit on how much space *can* be compressed, rather than offering a universal method for tradeoff. #ComputationalComplexity 5/5

On the "Depth-Accessibility" trade-off: There's a trade-off between conceptual depth and practical accessibility in complexity measures. This highlights the value of approximations in real-world #ComputationalComplexity #BigData" n/n ☕️vs🍷

The constructive nature of Thomassé's proof opens up possibilities for efficient #algorithms to find the vertex in the #DeanConjecture. This could have implications for tournament-related problems in computer science. #TCS #ComputationalComplexity #Algorithms

Hybrid CS Theory Seminar today 2025-03-14

We're excited to have Spencer Peters from Cornell presenting "Recursive Lattice Reduction"

spencerpeters.io
www.colorado.edu/cs-theory/th...

#MathSky #Algorithms #ComputationalComplexity

Harm Derksen will be talking about "Invariant Theory and [Computational] Complexity" in tomorrow's online CodEx Seminar: www.math.colostate.edu/~king/codex/

Tue Jan 28, 2025 10am Pacific
Sign up on the website for the zoom link

#MathSky #CSTheory #TheoryCS #TCS #ComputationalComplexity

A simplified proof of the CSP Dichotomy Conjecture and XY-symmetric operations We develop a new theory of strong subalgebras and linear congruences that are defined globally. Using this theory we provide a new proof of the correctness of Zhuk's algorithm for all tractable CSPs o...

Apparently I missed that Zhuk posted a *simplified* proof of the CSP Dichotomy Conjecture back in January: arxiv.org/abs/2404.01080

I'd really love to understand all of this!

#MathSky #ComputationalComplexity #complexity

Alan Turing and the Power of Negative Thinking Mathematical proofs based on a technique called diagonalization can be relentlessly contrarian, but they help reveal the limits of algorithms.

Turing's negative lens unveils computation's enigmatic bounds 🚫💻 His method sparks a surreal dive into computational complexity 🔄🎭 #AlanTuring #ComputationalComplexity #Diagonalization 🌐 go.digitalengineer.io/SI