Complexity Issues in Finding Succinct Solutions of PSPACE-Complete Problems
人工智能
2007-05-23 v3 计算复杂性
计算机科学中的逻辑
摘要
We study the problem of deciding whether some PSPACE-complete problems have models of bounded size. Contrary to problems in NP, models of PSPACE-complete problems may be exponentially large. However, such models may take polynomial space in a succinct representation. For example, the models of a QBF are explicitely represented by and-or trees (which are always of exponential size) but can be succinctely represented by circuits (which can be polynomial or exponential). We investigate the complexity of deciding the existence of such succinct models when a bound on size is given.
引用
@article{arxiv.cs/0503043,
title = {Complexity Issues in Finding Succinct Solutions of PSPACE-Complete Problems},
author = {Paolo Liberatore},
journal= {arXiv preprint arXiv:cs/0503043},
year = {2007}
}