Original language | English (US) |
---|---|
Pages (from-to) | 45-60 |
Journal | Theory of Computing |
Volume | 3 |
Issue number | 3 |
State | Published - 2007 |
On the hardness of satisfiability with bounded occurrences in the polynominal-time hierarchy
Ishay Haviv, Oded Regev, A. Ta-Shma
Research output: Contribution to journal › Article › peer-review