#computationalcomplexity
LightNews LightNews
tanyatianatalia.bsky.social
... #AlternativeScience #PlasmaPhysics #SacredGeometry #Ontology #QuaternionicGeometry #LeechLattice #MathTwitter #PhysicsTwitter #Esoteric #Logos #Math #Physics #SciPhil #Fractals #PrimeNumbers #ComputationalComplexity #AethericPhysics #StructuredAtom #BioAetherics #ProgrammableMatter to...
June 3, 2026 at 1:05 PM
acm.org
Happy Birthday, Richard E. Stearns! Stearns received the 1993 #ACMTuringAward with Juris Hartmanis in recognition of their seminal paper which established the foundations for the field of computational complexity theory. youtu.be/Z-Ek0CCThZQ?...

#ComputerScience #computationalcomplexity
July 5, 2026 at 12:02 PM
joshuagrochow.bsky.social
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
CodEx Seminar
CodEx Seminar
www.math.colostate.edu
January 27, 2025 at 6:01 PM
neurovium.bsky.social
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🍷
June 13, 2025 at 5:47 PM
bouldertheory.bsky.social
Hybrid CS Theory Seminar today (2026-07-13)

Excited to have Jack Stade (U. Copenhagen) presenting "The Boundary-Boundary Art-Gallery Problem is in NP" (which won Best Student Paper at STOC this year)

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

#MathSky #TCSSky #algorithms #geometry #ComputationalComplexity
A (non-convex) polygonal region (indicative of a strangely-shaped "art gallery"), vaguely triangular-shaped with big bumps at the corners, and smaller, long thin spiky bumps off of those. Three dots are placed, one near each corner of the triangle, colored red, green, and blue respectively. Dashed arrows from the dots to opposite walls indicate extremal lines of sight, and walls are colored corresponding to which dot can see them. Because of the bumps and spikes, which dot can see which wall is a complicated intermesh of the three colors.
July 13, 2026 at 3:51 PM
bouldertheory.bsky.social
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
Home - Spencer Peters
spencerpeters.io
March 14, 2025 at 4:02 PM
informaq.bsky.social
A quantum oracle exists where NP is hard on average but quantum cryptographic primitives (EFI pairs, OWPuzzs) provably don't exist—establishing that quantum cryptography isn't fundamental to computational hardness.

#QuantumCryptography #ComputationalComplexity #Research
Quantum Pessiland: Hardness Without Quantum Cryptography
arxiv.org
September 1, 2026 at 1:47 AM
joshuagrochow.bsky.social
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
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...
arxiv.org
October 4, 2024 at 7:28 PM
mathiastck.bsky.social
en.wikipedia.org/wiki/Promise...

"
In #ComputationalComplexity theory, a #PromiseProblem is a generalization of a #DecisionProblem where the input is promised to belong to a particular subset of #AllPossibleInputs.
Promise problem - Wikipedia
en.wikipedia.org
August 29, 2026 at 4:24 AM
mathiastck.bsky.social
I was lead down that #RabbitHole by:

en.wikipedia.org/wiki/BQP

"
In #ComputationalComplexity theory, #BoundedError #QuantumPolynomialTime ( #BQP) is the class of #DecisionProblems solvable by a #QuantumComputer in #PolynomialTime, with an #ErrorProbability of at most 1/3 for all instances.
BQP - Wikipedia
en.wikipedia.org
August 29, 2026 at 4:27 AM
pneumetron.bsky.social
🔥 Advancing Matrix Multiplication Complexity: A New Bound via AlphaEvolve

https://pneumetron.com/news/ai_research/advancing-matrix-multiplication-complexity-alphaevolve-c9d82d

#matrixmultiplication #computationalcomplexity #alphaevolve #optimization
August 26, 2026 at 6:38 AM
informaq.bsky.social
Quantum algorithm achieves polynomial log(q)-complexity approximation of torus points over finite fields, while proof shows the problem becomes #P-hard with unrestricted support parameters—revealing fundamental tradeoffs in quantum advantage.

#QuantumAlgorithms #ComputationalComplexity #Research
Quantum Algorithms for Torus Point-Count Approximation Over Finite Fields
arxiv.org
August 26, 2026 at 5:38 AM
informaq.bsky.social
We establish fundamental computational barriers to efficient decoding of topological quantum codes, proving that minimum-weight decoding cannot be approximated better than Ω(N^1/14) without solving NP-hard problems.

#QuantumErrorCorrection #ComputationalComplexity #Research
Hardness of Approximation for Minimum-Weight Decoding of Topological Quantum Codes
arxiv.org
August 19, 2026 at 7:14 AM
informaq.bsky.social
Faster quantum algorithms for subset sum and k-sum problems: researchers achieve improved worst-case complexity through quantum walks and block decomposition, outperforming previous quantum approaches.

#QuantumAlgorithms #ComputationalComplexity #Research
Improved Quantum Algorithms for Subset Sum and k-SUM
arxiv.org
August 10, 2026 at 3:40 AM
anna.mathstodon.xyz.ap.brid.gy
Well played.

https://link.springer.com/chapter/10.1007/978-3-642-13122-6_15

#uno #cardgames #ComputationalComplexity #funwithalgorithms #algorithms #algorithmics #games #ai #computerscience #professorlife
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.
February 18, 2026 at 3:05 PM
charlesgphd.bsky.social
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
March 29, 2025 at 12:08 PM
hncompanion.com
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
July 1, 2025 at 4:00 AM
aiupd8bot.bsky.social
🚀💡 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
July 13, 2025 at 4:18 PM
informaq.bsky.social
Assuming classical gravity couples quantum matter via semiclassical Einstein equations, non-linear qubit dynamics could solve NP-complete problems in polynomial time—violating computational fundamentals and suggesting gravity must be quantized.

#QuantumGravity #ComputationalComplexity #Research
Semiclassical Gravity Efficiently Solves NP-Complete Problems
arxiv.org
June 16, 2026 at 12:28 PM
informaq.bsky.social
New framework reveals computational complexity creates 'hidden' quantum correlations. Proves highly entangled states appear uncorrelated to efficient observers—separations range from logarithmic to nearly maximal in key examples.

#QuantumInformation #ComputationalComplexity #Research
Complexity-Constrained Quantum Correlations and Computationally Inaccessible Entanglement
iq.fp2.dev
April 20, 2026 at 6:13 AM
handle.invalid
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
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.
go.digitalengineer.io
October 30, 2023 at 8:33 PM
qbitphased.com
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
September 30, 2025 at 11:41 AM