#ComputationalComplexity

N-gated Hacker Newsngate
2025-06-09

🥳🎉 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. 🙄📚
blog.computationalcomplexity.o

Saulo Popov Zambiasisaulopz@corteximplant.com
2025-04-29

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

Dual-monitor desk setup with code and research paper on screen, colorful mechanical keyboard, and a focused work atmosphere.
Saulo Popov Zambiasisaulopz@pixelfed.social
2025-04-29
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
Dr. Anna Latouranna@mathstodon.xyz
2025-04-04

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

2025-03-03

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: math.colostate.edu/~king/codex

#Quantum #ComputationalComplexity

2025-02-01

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.

#ComputationalComplexity #CombinatorialGames

2025-01-27

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

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

#math #online #ComputationalComplexity #TCS #TheoryCS

2024-12-20

@onlineparallels Adding more hashtags for visibility of what's shaping up to be a cool online event paralleling ITCS '25!

sites.google.com/view/itcs2025

#math #TCS #ComputationalComplexity #complexity #online #TheoryCS

2024-11-05

Heard of AIM SQuaREs? (if you haven't, you should: aimath.org/programs/squares/)

Now we have Simons-Jane Circles (simons.berkeley.edu/participat), 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.

#ComputationalComplexity #Complexity

2024-10-27

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.

#ComputationalComplexity #Polytope

2024-10-22

#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: events.iu.edu/siceiub/event/16

#math #ComputationalComplexity #CS

2024-10-04

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!

#ComputationalComplexity #complexity #math #UniversalAlgebra

2024-08-09

Turns out rational approximation of irrationals is related to the Hartmanis-Stearns '65 Conjecture on real-time computability, from the same paper that introduced basic complexity classes like DTIME(f(n)). And sqrt(2) makes an appearance!

The Hartmanis-Stearns real-time computability conjecture is (equivalent to):

For a real number r, if there is an algorithm that computes the first n digits in O(n) time (for all n), then r is either rational or transcendental.

And, coming from this, sqrt(2) has an even cooler connection:

If the 1st n digits of sqrt(2) can't be computed in O(n) time, then n-bit integers can't be multiplied in O(n) time. -Lipton & Regan rjlipton.wpcomstaging.com/2012

(But...sqrt(2) probably isn't the only number for which the above is true. Still a cool connection, I think.)

#math #algorithms #NumberTheory #complexity #ComputationalComplexity

2024-08-07

I finally wrote a #CombinatorialGames piece I've wanted to write for a long time. It's about how Col's computational complexity went confusedly unsolved for over 35 years and how I got scooped at the end of that but still got a cool result. combinatorialgametheory.blogsp

#ComputationalComplexity #PSPACE

enoch_exe_incenoch_exe_inc
2024-08-04

The of regular mathematical operations is fascinating. It shows that nearly all the methods you learn in school for doing basic (and not-so-basic) maths are actually hugely inefficient, usually taking O(n²) (or worse), so we’ve invested a lot of time and effort into finding shortcuts that, for humans, are actually way worse and much more convoluted, but for computers, are much faster.

2024-05-03

I just finished listening to the latest If Books Could Kill episode, this one about Michael Lewis' book on Sam Bankman-Fried: twitter.com/IfBooksPod/status/

Saying that chess is too simple is a huge red flag for those aware that it's EXPTIME-hard. (sciencedirect.com/science/arti) If you can solve Chess scenarios effortlessly, then you can solve all sorts of extremely heavy computational problems that elude us. #CombinatorialGames #ComputationalComplexity

@rottenindenmark

Client Info

Server: https://mastodon.social
Version: 2025.04
Repository: https://github.com/cyevgeniy/lmst