Details
| Originalsprache | Englisch |
|---|---|
| Fachzeitschrift | Theoretical computer science |
| Publikationsstatus | Veröffentlicht - 1996 |
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
Recursion theoretic characterizations of complexity classes of counting functions. / Vollmer, H.; Wagner, K.W.
in: Theoretical computer science, 1996.
in: Theoretical computer science, 1996.
Publikation: Beitrag in Fachzeitschrift › Artikel › Forschung › Peer-Review
Vollmer H, Wagner KW. Recursion theoretic characterizations of complexity classes of counting functions. Theoretical computer science. 1996. doi: 10.1016/0304-3975(95)00237-5
Download
@article{e24b6ad4a98c401ca9b36b15b06ac49c,
title = "Recursion theoretic characterizations of complexity classes of counting functions",
author = "H. Vollmer and K.W. Wagner",
year = "1996",
doi = "10.1016/0304-3975(95)00237-5",
language = "English",
journal = "Theoretical computer science",
issn = "0304-3975",
publisher = "Elsevier",
}
Download
TY - JOUR
T1 - Recursion theoretic characterizations of complexity classes of counting functions
AU - Vollmer, H.
AU - Wagner, K.W.
PY - 1996
Y1 - 1996
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0030212604&partnerID=MN8TOARS
U2 - 10.1016/0304-3975(95)00237-5
DO - 10.1016/0304-3975(95)00237-5
M3 - Article
JO - Theoretical computer science
JF - Theoretical computer science
SN - 0304-3975
ER -