Raising a Hardness Result
| dc.creator | Liberatore, Paolo | |
| dc.date | 2007-08-30 | |
| dc.date.accessioned | 2026-07-07T08:26:42Z | |
| dc.date.available | 2026-07-07T08:26:42Z | |
| dc.description | This article presents a technique for proving problems hard for classes of the polynomial hierarchy or for PSPACE. The rationale of this technique is that some problem restrictions are able to simulate existential or universal quantifiers. If this is the case, reductions from Quantified Boolean Formulae (QBF) to these restrictions can be transformed into reductions from QBFs having one more quantifier in the front. This means that a proof of hardness of a problem at level n in the polynomial hierarchy can be split into n separate proofs, which may be simpler than a proof directly showing a reduction from a class of QBFs to the considered problem. | |
| dc.identifier | https://arxiv.org/abs/0708.4170 | |
| dc.identifier | http://arxiv.org/abs/0708.4170 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/137029 | |
| dc.subject | Artificial Intelligence | |
| dc.subject | Computational Complexity | |
| dc.subject | Logic in Computer Science | |
| dc.title | Raising a Hardness Result | |
| dc.type | text |