PSPACE完备问题简洁解的复杂性问题
Complexity Issues in Finding Succinct Solutions of PSPACE-Complete Problems
摘要：
我们研究的问题，决定一些PSPACE完全问题是否有界大小的模型。与NP问题相反，PSPACE完全问题的模型可能是指数级的。然而，这样的模型可以采用简洁表示的多项式空间。例如，QBF的模型由与或树（总是指数大小）显式表示，但可以由电路（可以是多项式或指数）简洁地表示。我们调查的复杂性，决定这种简洁的模型的存在时，大小上的限制。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
