Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Allender:1993:AEC, author = "Eric Allender and Richard Beigel and Ulrich Hertrampf and Steven Homer", title = "Almost-everywhere complexity hierarchies for nondeterministic time", journal = j-THEOR-COMP-SCI, volume = "115", number = "2", pages = "225--241", day = "19", month = jul, year = "1993", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:17:23 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1993&volume=115&issue=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=1993&volume=115&issue=2&aid=1380", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Rutgers Univ., New Brunswick, NJ, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "almost everywhere complexity; computational complexity; nondeterministic time; relativizable proof techniques", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", }