Details
| Original language | English |
|---|---|
| Journal | Theoretical computer science |
| Publication status | Published - 1997 |
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
Gap-languages and log-time complexity classes. / Regan, K.W.; Vollmer, H.
In: Theoretical computer science, 1997.
In: Theoretical computer science, 1997.
Research output: Contribution to journal › Article › Research › peer review
Regan KW, Vollmer H. Gap-languages and log-time complexity classes. Theoretical computer science. 1997. doi: 10.1016/S0304-3975(96)00288-5
Download
@article{66f1db78f1f84df08b268d01ff693e98,
title = "Gap-languages and log-time complexity classes",
author = "K.W. Regan and H. Vollmer",
note = "Funding information: * Corresponding author. E-mail: vollmer@informatik.uni.wuerzburg.de. Supported in van Humboldt fellowship, while the author held a visiting position at the University Barbara. {\textquoteright} Supported in part by the National Science Foundation under Grant CCR-9409104.",
year = "1997",
doi = "10.1016/S0304-3975(96)00288-5",
language = "English",
journal = "Theoretical computer science",
issn = "0304-3975",
publisher = "Elsevier",
}
Download
TY - JOUR
T1 - Gap-languages and log-time complexity classes
AU - Regan, K.W.
AU - Vollmer, H.
N1 - Funding information: * Corresponding author. E-mail: vollmer@informatik.uni.wuerzburg.de. Supported in van Humboldt fellowship, while the author held a visiting position at the University Barbara. ’ Supported in part by the National Science Foundation under Grant CCR-9409104.
PY - 1997
Y1 - 1997
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0031272607&partnerID=MN8TOARS
U2 - 10.1016/S0304-3975(96)00288-5
DO - 10.1016/S0304-3975(96)00288-5
M3 - Article
JO - Theoretical computer science
JF - Theoretical computer science
SN - 0304-3975
ER -