First quantum algorithm achieving asymptotic speedup over classical algorithms for maximum-weight perfect matching in general graphs. Achieves Õ(nm²/³log W) time, improving on classical Õ(m√n log W) in dense regimes.
@informaq.bsky.social
@informaq.bsky.socialFirst quantum algorithm achieving asymptotic speedup over classical algorithms for maximum-weight perfect matching in general graphs. Achieves Õ(nm²/³log W) time, improving on classical Õ(m√n log W) in dense regimes.
@informaq.bsky.socialFirst nontrivial quantum lower bounds for triangle listing (Ω(n^3/2)) and multiplicative k-spanner construction via novel recording framework extensions with bidirectional oracle architecture.
@wbkboyer.northsky.socialI’m so proud to announce the publication of a submission to the Journal of Open Source Software co-authored by John M. Boyer and myself, showcasing the Edge Addition Planarity Suite, the Planarity #Cython wrapper, and the Edge Addition Planarity Suite Testing #Python package 🚀🎉 #graphalgorithms