![]() |
@article{DBLP:journals/toc/HavivRT07,
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},
volume = {3},
number = {1},
year = {2007},
pages = {45-60},
ee = {http://dx.doi.org/10.4086/toc.2007.v003a003},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Copyright © 2009-02-17 by Michael Ley (ley@uni-trier.de)