Details
| Original language | English |
|---|---|
| Title of host publication | f |
| Publication status | Published - 28 Sept 1998 |
Publication series
| Name | Annals of Pure and Applied Logic |
|---|---|
| Publisher | Elsevier |
| ISSN (Print) | 0003-4843 |
Abstract
Keywords
- cs.CC, F.1.3
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
f. 1998. (Annals of Pure and Applied Logic).
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research
}
TY - GEN
T1 - A Generalized Quantifier Concept in Computational Complexity Theory
AU - Vollmer, Heribert
PY - 1998/9/28
Y1 - 1998/9/28
N2 - 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.
AB - 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.
KW - cs.CC
KW - F.1.3
M3 - Conference contribution
T3 - Annals of Pure and Applied Logic
BT - f
ER -