A Generalized Quantifier Concept in Computational Complexity Theory

Simple item page
dc.creatorVollmer, Heribert
dc.date1998-09-28
dc.date.accessioned2026-07-07T03:23:41Z
dc.date.available2026-07-07T03:23:41Z
dc.descriptionA 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.
dc.identifierhttps://arxiv.org/abs/cs/9809115
dc.identifierhttp://arxiv.org/abs/cs/9809115
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/33043
dc.subjectComputational Complexity
dc.subjectF.1.3
dc.titleA Generalized Quantifier Concept in Computational Complexity Theory
dc.typetext

Files

Collections

arXiv