Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Duris:1994:NDO, author = "Pavol {\v{D}}uri{\v{s}} and Jos{\'e} D. P. Rolim", title = "A note on the density of oracle decreasing time-space complexity", journal = j-THEOR-COMP-SCI, volume = "132", number = "1--2", pages = "435--444", day = "26", month = sep, year = "1994", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:18:25 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=132&issue=1-2; http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1994&volume=132&issue=1-2&aid=1713", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Centre Univ. d'Inf., Geneva Univ., Switzerland", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; density of oracles; multitape Turing machines; off-line Turing machines; recognition; time-space complexity; Turing machines", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", }