@article{
author = {Ishay Haviv and  Oded Regev and  Amnon Ta-Shma},
title = {On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy},
journal = {Theory of Computing},
year = {2007},
volume = {3},
number = {1},
pages = {45-60},
publisher = {Theory of Computing},
eprint = {toc:v003/a003},
URL = {http://www.theoryofcomputing.org/articles/main/v003/a003},
}