2003/02/12 by Jens Gramm, Edward Hirsch, Edward A. Hirsch +2 · 3 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithm #Boolean function #Boolean satisfiability problem #Combinatorics #Complexity and Algorithms in Graphs #Discrete mathematics #Exponential time hypothesis #Formal Methods in Verification #Graph #Mathematics #Maximum cut #Maximum satisfiability problem #Running time #Satisfiability #Time complexity #Upper and lower bounds
paper · pdf · doi:10.1016/s0166-218x(02)00402-x
openalex publication_date 2003/02/12 · crossref created 2003/02/12 · crossref issued 2003/08/01 · crossref published 2003/08/01 · crossref published-print 2003/08/01 · crossref deposited 2020/03/12 · crossref indexed 2025/10/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/02