A Generalized Quantifier Concept in Computational Complexity Theory
计算复杂性
2007-05-23 v1
摘要
A notion of generalized quantifier in computational complexity theory is explored and used to give a unified treatment of leaf language definability, oracle separations, type 2 operators, and circuits with monoidal gates. Relations to Lindstroem quantifiers are pointed out.
引用
@article{arxiv.cs/9809115,
title = {A Generalized Quantifier Concept in Computational Complexity Theory},
author = {Heribert Vollmer},
journal= {arXiv preprint arXiv:cs/9809115},
year = {2007}
}