most citedA Hierarchy of Spectral Gap Certificates for Frustration-Free Spin Systems

1 citations · 1 across the 1 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2025

A Simpler Exponential-Time Approximation Algorithm for MAX-k-SAT

Harry Buhrman, Sevag Gharibian, Zeph Landau +3

We present an extremely simple polynomial-space exponential-time -approximation algorithm for MAX-k-SAT that is (slightly) faster than the previous known polynomia…