Last update: Sun Oct 15 02:56:11 MDT 2017
@Article{Levin:1996:CCF, author = "Leonid A. Levin", title = "Computational complexity of functions", journal = j-THEOR-COMP-SCI, volume = "157", number = "2", pages = "267--271", day = "05", month = may, year = "1996", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:19:53 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=157&issue=2; http://www.math.utah.edu/pub/tex/bib/tcs1995.bib", URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1996&volume=157&issue=2&aid=2104", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240C (Computational complexity)", corpsource = "Dept. of Comput. Sci., Boston Univ., MA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "complexities; computability; computational complexity", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", }