Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Ferreira:1993:SEA,
author = "A. Ferreira",
title = "On space-efficient algorithms for certain
{NP}-complete problems",
journal = j-THEOR-COMP-SCI,
volume = "120",
number = "2",
pages = "311--315",
day = "22",
month = nov,
year = "1993",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:17:43 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1993&volume=120&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=120&issue=2&aid=1474",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Lab. de l'Inf. du Parallelisme, Ecole Normale
Sup{\'e}rieure de Lyon, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; NP-complete problems;
space-efficient algorithms; storage requirements",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}