Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Ko:1991:AVN,
author = "K.-I. Ko",
title = "On adaptive versus nonadaptive bounded query
machines",
journal = j-THEOR-COMP-SCI,
volume = "82",
number = "1",
pages = "51--69",
day = "22",
month = may,
year = "1991",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:24:22 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Comput. Sci., State Univ. of New York, Stony
Brook, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; machines; nonadaptive
bounded query machines; polynomial time adaptive
bounded query machines; sparse oracles; truth table
bounded query; Turing machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}