Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Cucker:1994:SCC, author = "F. Cucker and M. Shub and S. Smale", title = "Separation of complexity classes in {Koiran}'s weak model", journal = j-THEOR-COMP-SCI, volume = "133", number = "1", pages = "3--14", day = "11", month = oct, year = "1994", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:18:27 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=133&issue=1; 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=133&issue=1&aid=1710", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", conflocation = "Barcelona, Spain; 4-6 Oct. 1993", conftitle = "Workshop on Continuous Algorithms and Complexity", corpsource = "Pompeu Univ., Barcelona, Spain", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "complexity classes separation; computational complexity; Koiran's weak model; nondeterministic machines; weak polynomial time", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", }