On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy
Work
Year: 2007
Type: article
Abstract: In 1991, Papadimitriou and Yannakakis gave a reduction implying the NPhardness of approximating the problem 3 -SAT with bounded occurrences.Their reduction is based on expander graphs.We present an an... more
Source: Theory of Computing
Authors Ishay Haviv, Oded Regev, Amnon Ta‐Shma
Institution Tel Aviv University
Cites: 12
Cited by: 5
Related to: 10
FWCI: 0.606
Citation percentile (by year/subfield): 68.71
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid