Last update: Thu Sep 27 02:46:39 MDT 2018
@Article{Baker:1979:SST,
author = "T. P. Baker and A. L. Selman",
title = "A second step toward the polynomial hierarchy",
journal = j-THEOR-COMP-SCI,
volume = "8",
number = "2",
pages = "177--187",
month = apr,
year = "1979",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1975.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Computer Sci. Dept., Univ. of Iowa, Iowa City, IA,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "formal language; formal languages; polynomial
hierarchy; recursive oracle",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}