Details
| Originalsprache | Englisch |
|---|---|
| Fachzeitschrift | Computational complexity |
| Publikationsstatus | Veröffentlicht - 1998 |
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
in: Computational complexity, 1998.
Publikation: Beitrag in Fachzeitschrift › Artikel › Forschung › Peer-Review
}
TY - JOUR
T1 - Probabilistic type-2 operators and "almost"-classes
AU - Book, R.V.
AU - Vollmer, H.
AU - Wagner, K.W.
N1 - Funding information: A preliminary abstract of this paper appeared in the proceedings of the 23rd International Colloquium on Automata, Languages, and Programming. Research supported by NSF Grant CCR-93-02057, DFG Grant Wa 847/1, and a Feodor-Lynen-Fellowship from the Alexander von Humboldt Foundation.
PY - 1998
Y1 - 1998
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0032263556&partnerID=MN8TOARS
U2 - 10.1007/s000370050012
DO - 10.1007/s000370050012
M3 - Article
JO - Computational complexity
JF - Computational complexity
SN - 1016-3328
ER -