On the hardness of satisfiability with bounded occurrences in the polynominal-time hierarchy

Ishay Haviv, Oded Regev, A. Ta-Shma

Research output: Contribution to journalArticlepeer-review

Original languageEnglish (US)
Pages (from-to)45-60
JournalTheory of Computing
Volume3
Issue number3
StatePublished - 2007

Cite this