We give faster exponential-time randomised approximation algorithms for counting problems where polynomial-time approximation is unavailable and exact exponential-time counting remains expensive. For general \(n\)-vertex graphs, our independent-set counter runs in \(O^{\ast}(1.1869^{n})\) time, improving the previous \(O^{\ast}(1.2041^{n})\) general-graph bound.
Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile
Get in touch with Serge
Contact Serge, search articles and posts on X, monitor coverage, and track replies from one place.
Learn more about Muck Rack