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