QUEST Leibniz Forschungsschule

A Generalized Quantifier Concept in Computational Complexity Theory

verfasst von: Heribert Vollmer
Abstract: 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.
Organisationseinheit(en): Institut für Theoretische Informatik
Typ: Aufsatz in Konferenzband
Publikationsdatum: 28.09.1998
Publikationsstatus: Veröffentlicht

BibTeX

@inproceedings{5f6d07d693014d18a9151271ca64631c,
title = "A Generalized Quantifier Concept in Computational Complexity Theory",
abstract = " 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. ",
keywords = "cs.CC, F.1.3",
author = "Heribert Vollmer",
year = "1998",
month = sep,
day = "28",
language = "English",
series = "Annals of Pure and Applied Logic",
publisher = "Elsevier",
booktitle = "f",
}

Letzte Änderung: 09.02.23; Dr. A. Wanner Druckversion